Sciweavers

4 search results - page 1 / 1
» Probabilistic threshold k nearest neighbor queries over movi...
Sort
View
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 6 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
TKDE
2008
162views more  TKDE 2008»
13 years 4 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...
EDBT
2009
ACM
207views Database» more  EDBT 2009»
13 years 7 months ago
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...
SIGMOD
2010
ACM
262views Database» more  SIGMOD 2010»
13 years 9 months ago
K-nearest neighbor search for fuzzy objects
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
Kai Zheng, Gabriel Pui Cheong Fung, Xiaofang Zhou