Sciweavers

138 search results - page 21 / 28
» K-Nearest Neighbor Search for Moving Query Point
Sort
View
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
14 years 8 months ago
Nearest Surrounder Queries
In this paper, we study a new type of spatial query, Nearest Surrounder (NS), which searches the nearest surrounding spatial objects around a query point. NS query can be more use...
Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong
GIS
2007
ACM
14 years 8 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
EDBT
2009
ACM
92views Database» more  EDBT 2009»
13 years 11 months ago
Efficient skyline computation in metric space
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
David Fuhry, Ruoming Jin, Donghui Zhang
ICML
2006
IEEE
14 years 4 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
AAAI
2012
11 years 9 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li