Sciweavers

138 search results - page 17 / 28
» K-Nearest Neighbor Search for Moving Query Point
Sort
View
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 7 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
3DIM
2003
IEEE
14 years 21 days ago
Effective Nearest Neighbor Search for Aligning and Merging Range Images
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...
Ryusuke Sagawa, Tomohito Masuda, Katsushi Ikeuchi
VLDB
2004
ACM
227views Database» more  VLDB 2004»
14 years 22 days ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
14 years 8 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis
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...