208 search results - page 21 / 42 » Querying Moving Objects with Uncertainty in Spatio-Temporal ... |
132
click to vote
SSD
2007
Springer
15 years 3 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 ...
SSD
2009
Springer
15 years 4 months ago
2009
Springer
With the exponential growth of moving objects data to the Gigabyte range, it has become critical to develop effective techniques for indexing, updating, and querying these massive ...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
Indoor spaces accommodate large populations of individuals. The continuous range monitoring of such objects can be used as a foundation for a wide variety of applications, e.g., s...
APPT
2005
Springer
14 years 11 months ago
2005
Springer
It is difficult to maintain the exact location of mobile objects due to the limited resources in a mobile network. A consequence of this problem is that the update cost for a locat...
170
click to vote
VLDB
2008
ACM
15 years 9 months ago
2008
ACM
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...