Sciweavers

265 search results - page 34 / 53
» Universal Trajectory Queries for Moving Object Databases
Sort
View
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
14 years 7 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
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...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...
GIS
2008
ACM
14 years 8 months ago
Privacy: preserving trajectory collection
In order to provide context?aware Location?Based Services, real location data of mobile users must be collected and analyzed by spatio?temporal data mining methods. However, the d...
Gyözö Gidófalvi, Torben Bach Pede...
GIS
2010
ACM
13 years 6 months ago
Evaluation of cardinal direction developments between moving points
Recently, a wide range of applications like hurricane research, fire management, navigation systems, and transportation, to name only a few, has shown increasing interest in mana...
Tao Chen, Hechen Liu, Markus Schneider
ICDE
2007
IEEE
110views Database» more  ICDE 2007»
14 years 9 months ago
Pointwise-Dense Region Queries in Spatio-temporal Databases
Applications such as traffic management and resource scheduling for location-based services commonly need to identify regions with high concentrations of moving objects. Such quer...
Jinfeng Ni, Chinya V. Ravishankar
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
14 years 9 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...