Sciweavers

27 search results - page 2 / 6
» Supporting Subseries Nearest Neighbor Search via Approximati...
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 5 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
GIS
2010
ACM
13 years 4 months ago
Reverse k-Nearest Neighbor monitoring on mobile objects
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 5 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
GIS
2005
ACM
14 years 6 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
VLDB
1999
ACM
118views Database» more  VLDB 1999»
13 years 9 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani