1100 search results - page 200 / 220 » Approximate distance oracles |
105
click to vote
APPROX
2011
Springer
13 years 12 months ago
2011
Springer
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
104
click to vote
ICCV
1999
IEEE
16 years 1 months ago
1999
IEEE
A new approach to computing a panoramic (360 degrees) depth map is presented in this paper. Our approach uses a large collection of images taken by a camera whose motion has been c...
PODC
2009
ACM
16 years 16 days ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
STOC
2005
ACM
16 years 9 days ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
188
click to vote
SIGMOD
2008
ACM
16 years 4 days ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...