Sciweavers

32 search results - page 3 / 7
» Fast object search on road networks
Sort
View
4OR
2010
148views more  4OR 2010»
13 years 3 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
IDEAS
2006
IEEE
146views Database» more  IDEAS 2006»
13 years 11 months ago
Trajectory Similarity Search in Spatial Networks
In several applications, data objects are assumed to move on predefined spatial networks such as road segments, railways, invisible air routes. Moving objects may exhibit similar...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Ale...
TAPAS
2011
286views Algorithms» more  TAPAS 2011»
13 years 7 days ago
Alternative Route Graphs in Road Networks
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...
SIGMOD
2010
ACM
267views Database» more  SIGMOD 2010»
13 years 10 months ago
Processing proximity relations in road networks
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
Zhengdao Xu, Hans-Arno Jacobsen
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
13 years 6 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders