Sciweavers

172 search results - page 9 / 35
» Continuous Medoid Queries over Moving Objects
Sort
View
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 1 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
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...
Bin Yang 0002, Hua Lu, Christian S. Jensen
125
Voted
ICDE
2005
IEEE
172views Database» more  ICDE 2005»
15 years 5 months ago
Monitoring K-Nearest Neighbor Queries Over Moving Objects
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...
Xiaohui Yu, Ken Q. Pu, Nick Koudas
APPT
2005
Springer
15 years 1 months ago
Probabilistic Continuous Update Scheme in Location Dependent Continuous Queries
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...
Song Han, Edward Chan
SSD
2009
Springer
142views Database» more  SSD 2009»
15 years 6 months ago
Monitoring Orientation of Moving Objects around Focal Points
Abstract. We consider a setting with numerous location-aware moving objects that communicate with a central server. Assuming a set of focal points of interest, we aim at continuous...
Kostas Patroumpas, Timos K. Sellis
83
Voted
EDBT
2009
ACM
174views Database» more  EDBT 2009»
15 years 6 months ago
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter...