Sciweavers

49 search results - page 3 / 10
» Efficient Algorithms to Monitor Continuous Constrained k Nea...
Sort
View
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 11 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
MDM
2010
Springer
281views Communications» more  MDM 2010»
13 years 12 months ago
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
Jie Bao 0003, Chi-Yin Chow, Mohamed F. Mokbel, Wei...
GEOINFORMATICA
2007
223views more  GEOINFORMATICA 2007»
13 years 10 months ago
Algorithms for Nearest Neighbor Search on Moving Object Trajectories
Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far d...
Elias Frentzos, Kostas Gratsias, Nikos Pelekis, Ya...
ICDE
2011
IEEE
380views Database» more  ICDE 2011»
13 years 1 months ago
Influence Zone: Efficiently Processing Reverse k Nearest Neighbors Queries
Given a set of objects and a query q, a point p is called the reverse k nearest neighbor (RkNN) of q if q is one of the k closest objects of p. In this paper, we introduce the c...
Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Y...
TKDE
2008
162views more  TKDE 2008»
13 years 10 months ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...