64 search results - page 1 / 13 » Efficient Location Updates for Continuous Queries over Movin... |
JCST
2010
12 years 11 months ago
2010
Abstract The significant overhead related to frequent location updates from moving objects often results in poor performance. As most of the location updates do not affect the quer...
GIS
2007
ACM
14 years 5 months ago
2007
ACM
Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data ...
SSD
2007
Springer
13 years 10 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 ...
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...
DASFAA
2009
IEEE
13 years 11 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...