1632 search results - page 4 / 327 » Sublinear Time Algorithms for Metric Space Problems |
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
ESA
2007
Springer
15 years 3 months ago
2007
Springer
We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking. Our algorithms achieve a running times o...
113
click to vote
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
IJFCS
2006
14 years 9 months ago
2006
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...