87 search results - page 12 / 18 » Approximate Nearest Neighbor Queries Revisited |
210
click to vote
SIGMOD
2006
ACM
16 years 2 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...
122
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
152
click to vote
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
127
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
229
click to vote
VLDB
2007
ACM
16 years 2 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...