Sciweavers

167 search results - page 10 / 34
» Nearest Neighbor Queries in Metric Spaces
Sort
View
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
14 years 8 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 7 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
14 years 9 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
PVLDB
2008
232views more  PVLDB 2008»
13 years 6 months ago
FINCH: evaluating reverse k-Nearest-Neighbor queries on location data
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...
Wei Wu, Fei Yang, Chee Yong Chan, Kian-Lee Tan
COMPGEOM
1997
ACM
13 years 11 months ago
Approximate Nearest Neighbor Queries Revisited
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
Timothy M. Chan