相关论文: Stream-orbit misalignment II: A new algorithm to c…

We propose a defiltering method of turbulent flow fields for Lagrangian particle tracking using machine learning techniques. Numerical simulation of Lagrangian particle tracking is commonly used in various fields. In general, practical…

We present an algorithm for the maximum matching problem in dynamic (insertion-deletions) streams with *asymptotically optimal* space complexity: for any $n$-vertex graph, our algorithm with high probability outputs an $\alpha$-approximate…

Constellation shaping is a practical and effective technique to improve the performance and the rate adaptivity of optical communication systems. In principle, it could also be used to mitigate the impact of nonlinear effects, possibly…

We revisit one of the classic problems in the data stream literature, namely, that of estimating the frequency moments $F_p$ for $0 < p < 2$ of an underlying $n$-dimensional vector presented as a sequence of additive updates in a stream. It…

We consider the bidimensional Stokes problem for incompressible fluids in stream function-vorticity. For this problem, the classical finite elements method of degree one converges only to order one-half for the L2 norm of the vorticity. We…

We present N-body simulations of dissolving star clusters close to galactic centres. For this purpose, we developed a new N-body program called nbody6gc based on Aarseth's series of N-body codes. We describe the algorithm in detail. We…

It is by now well-known that one can recover a potential in the wave equation from the knowledge of the initial waves, the boundary data and the flux on a part of the boundary satisfying the Gamma-conditions of J.-L. Lions. We are…

(abridged) We present a detailed analysis of the properties of tidally stripped material from disrupting substructure haloes or subhaloes in a sample of high resolution cosmological N-body host haloes ranging from galaxy- to cluster-mass…

Motion planning for vehicles under the influence of flow fields can benefit from the idea of streamline-based planning, which exploits ideas from fluid dynamics to achieve computational efficiency. Important to such planners is an efficient…

We consider the problem of monotone, submodular maximization over a ground set of size $n$ subject to cardinality constraint $k$. For this problem, we introduce the first deterministic algorithms with linear time complexity; these…

We present a method to constrain galaxy parameters directly from three-dimensional data cubes. The algorithm compares directly the data with a parametric model mapped in $x,y,\lambda$ coordinates. It uses the spectral lines-spread function…

How condensed-matter simulations depend on the number of molecules being simulated ($N$) is sometimes itself a valuable piece of information. Liquid crystals provide a case in point. Light scattering and $2d$-IR experiments on…

In this contribution we propose reduced order methods to fast and reliably solve parametrized optimal control problems governed by time dependent nonlinear partial differential equations. Our goal is to provide a tool to deal with the time…

We study fundamental directed graph (digraph) problems in the streaming model. An initial investigation by Chakrabarti, Ghosh, McGregor, and Vorotnikova [SODA'20] on streaming digraphs showed that while most of these problems are provably…

The orbits of short-period exoplanets are sculpted by tidal dissipation. However, the mechanisms and associated efficiencies of these tidal interactions are poorly constrained. We present robust constraints on the tidal quality factors of…

Tidal debris from Galactic satellites generally forms one-dimensional elongated streams, since nearby Galactic orbits have almost identical frequency ratios. We show that the situation is different for orbits close to the Galactic disc,…

The need to estimate a particular quantile of a distribution is an important problem which frequently arises in many computer vision and signal processing applications. For example, our work was motivated by the requirements of many…

We present a reduced basis technique for long-time integration of parametrized incompressible turbulent flows. The new contributions are threefold. First, we propose a constrained Galerkin formulation that corrects the standard Galerkin…

We address the problem of estimating the running quantile of a data stream when the memory for storing observations is limited. We (i) highlight the limitations of approaches previously described in the literature which make them unsuitable…

This paper considers the problem of cardinality estimation in data stream applications. We present a statistical analysis of probabilistic counting algorithms, focusing on two techniques that use pseudo-random variates to form…