1632 search results - page 15 / 327 » Sublinear Time Algorithms for Metric Space Problems |
138
Voted
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
138
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
113
click to vote
ALGORITHMICA
1999
15 years 2 months ago
1999
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
126
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
168
click to vote
SPIRE
2005
Springer
15 years 8 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...