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

In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the arcs. If the source and the sink are on the same face, then…

The spin-orbit angle, or obliquity, is a powerful observational marker that allows us to access the dynamical history of exoplanetary systems. Here, we have examined the distribution of spin-orbit angles for close-in exoplanets and put it…

We present a method to estimate two-dimensional, time-invariant oceanic flow fields based on data from both ensemble forecasts and online measurements. Our method produces a realistic estimate in a computationally efficient manner suitable…

An efficient algorithm of tidal harmonic analysis and prediction is presented in this paper. Some conditions are found by means of the known approximate relationships between the harmonic constants of the tidal constituents. A system of…

This paper deals with the problem of estimating the delays and amplitudes of a weighted superposition of pulses, called stream of pulses. This problem is motivated by a variety of applications, such as ultrasound and radar. This paper shows…

We consider an online two-stage stochastic optimization with long-term constraints over a finite horizon of $T$ periods. At each period, we take the first-stage action, observe a model parameter realization and then take the second-stage…

Obtaining reliable distance estimates to gas clouds within the Milky Way is challenging in the absence of certain tracers. The kinematic distance approach has been used as an alternative, derived from the assumption of circular trajectories…

This paper is related to our previous works [1][2] on the error estimate of the averaging technique, for systems with one fast angular variable. In the cited references, a general method (of mixed analytical and numerical type) has been…

The problem of determination of the orbital velocity of an astrometric satellite from its own observational data is studied. It is well known that data processing of microarcsecond-level astrometric observations imposes very stringent…

Many problems on data streams have been studied at two extremes of difficulty: either allowing randomized algorithms, in the static setting (where they should err with bounded probability on the worst case stream); or when only…

We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms…

Tidal features are a key observable prediction of the hierarchical model of galaxy formation and contain a wealth of information about the properties and history of a galaxy. Modern wide-field surveys such as LSST and Euclid will…

In this letter a new method based on modified self-organizing maps is presented for the reconstruction of deep ocean current velocities from surface information provided by satellites. This method takes advantage of local correlations in…

A tidal radius is a distance from a satellite orbiting in a host potential beyond which its material is stripped by the tidal force. We derive a revised expression for the tidal radius of a rotating satellite which properly takes into…

Where are the Earth's streams flowing right now? Inland surface waters expand with floods and contract with droughts, so there is no one map of our streams. Current satellite approaches are limited to monthly observations that map only the…

In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{11/8+o(1)}U^{1/4}$ time with high probability.…

This paper presents a method for the approximation of harmonic potentials that combines downward continuation of globally available data on a sphere $\Omega_R$ of radius $R$ (e.g., a satellite's orbit) with locally available data on a…

We describe a new method of overcoming problems inherent in peculiar velocity surveys by using data compression as a filter with which to separate large-scale, linear flows from small-scale noise that biases the results systematically. We…

We study the problem of estimating the number of triangles in a graph stream. No streaming algorithm can get sublinear space on all graphs, so methods in this area bound the space in terms of parameters of the input graph such as the…

We develop and analyze algorithms for instrumental variable regression by viewing the problem as a conditional stochastic optimization problem. In the context of least-squares instrumental variable regression, our algorithms neither require…