314 search results - page 10 / 63 » Querying Imprecise Data in Moving Object Environments |
100
click to vote
EDBT
2010
ACM
14 years 11 months ago
2010
ACM
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...
135
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 ...
CDB
2004
Springer
15 years 3 months ago
2004
Springer
Moving objects are currently represented in databases by means of an explicit representation of their trajectory. However from a physical point of view, or more specifically accor...
GIS
2008
ACM
14 years 10 months ago
2008
ACM
Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location...
108
click to vote
ICDE
2005
IEEE
15 years 3 months ago
2005
IEEE
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem...