133 search results - page 12 / 27 » Approximate Nearest Subspace Search |
CCCG
2010
13 years 9 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
BTW
2007
Springer
13 years 11 months ago
2007
Springer
: 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, has received increasing a...
3DIM
2003
IEEE
13 years 11 months ago
2003
IEEE
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
FOCS
2008
IEEE
13 years 7 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
SSDBM
2010
IEEE
14 years 20 days ago
2010
IEEE
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...