Sciweavers

11 search results - page 2 / 3
» Point-to-point shortest paths on dynamic time-dependent road...
Sort
View
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 5 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 5 months ago
Fast paths in large-scale dynamic road networks
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
Giacomo Nannicini, Philippe Baptiste, Gilles Barbi...
MASS
2010
186views Communications» more  MASS 2010»
13 years 3 months ago
VAN: Vehicle-assisted shortest-time path navigation
Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is gettin...
Wenping Chen, Sencun Zhu, Deying Li
AINA
2008
IEEE
13 years 11 months ago
A Map Matching Algorithm for Car Navigation Systems that Predict User Destination
In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predict...
Koichi Miyashita, Tsutomu Terada, Shojiro Nishio
GIS
2002
ACM
13 years 5 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...