186 search results - page 2 / 38 » Continuous Monitoring of Distance Based Range Queries |
GIS
2008
ACM
14 years 6 months ago
2008
ACM
We report on our experience from design and implementation of a powerful map application for managing, querying and visualizing evolving locations of moving objects. Instead of bu...
TKDE
2008
13 years 4 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...
SSD
2007
Springer
13 years 11 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 ...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
DASFAA
2009
IEEE
13 years 12 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...