120 search results - page 16 / 24 » Complementary Hashing for Approximate Nearest Neighbor Searc... |
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...
238
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
130
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
141
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
159
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...