1632 search results - page 16 / 327 » Sublinear Time Algorithms for Metric Space Problems |
137
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
141
click to vote
ICPP
2006
IEEE
15 years 9 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
151
click to vote
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
223
click to vote
SIGMOD
2006
ACM
16 years 3 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
119
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We address the problem of autonomously learning controllers for visioncapable mobile robots. We extend McCallum's (1995) Nearest-Sequence Memory algorithm to allow for genera...