43 search results - page 5 / 9 » Monitoring K-Nearest Neighbor Queries Over Moving Objects |
145
click to vote
ICDE
2006
IEEE
15 years 8 months ago
2006
IEEE
Continuous spatio-temporal queries have recently received increasing attention due to the abundance of location-aware applications. This paper addresses the Continuous Reverse Nea...
130
click to vote
TKDE
2008
15 years 1 months ago
2008
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...
178
click to vote
SSD
2007
Springer
15 years 8 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
123
Voted
DASFAA
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract. Continuous spatial queries retrieve a set of time-varying objects continuously during a given period of time. However, monitoring moving objects to maintain the correctne...
262
click to vote
ICDE
2008
IEEE
17 years 1 months ago
2008
IEEE
In applications like location-based services, sensor monitoring and biological databases, the values of the database items are inherently uncertain in nature. An important query fo...