49 search results - page 7 / 10 » Efficient Algorithms to Monitor Continuous Constrained k Nea... |
NIPS
2004
13 years 9 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
ECCV
2010
Springer
14 years 24 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
VLDB
2004
ACM
14 years 28 days ago
2004
ACM
Given a 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 processing such quer...