Sciweavers

138 search results - page 12 / 28
» K-Nearest Neighbor Search for Moving Query Point
Sort
View
GIS
2005
ACM
14 years 8 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
DATESO
2010
153views Database» more  DATESO 2010»
13 years 5 months ago
Answering Metric Skyline Queries by PM-tree
Abstract. The task of similarity search in multimedia databases is usually accomplished by range or k nearest neighbor queries. However, the expressing power of these "single-...
Tomás Skopal, Jakub Lokoc
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 8 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
ICDE
2006
IEEE
225views Database» more  ICDE 2006»
14 years 1 months ago
Continuous Reverse Nearest Neighbor Monitoring
Continuous spatio-temporal queries have recently received increasing attention due to the abundance of location-aware applications. This paper addresses the Continuous Reverse Nea...
Tian Xia, Donghui Zhang
SADM
2010
196views more  SADM 2010»
13 years 2 months ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty