134 search results - page 3 / 27 » Speeding Up Dynamic Shortest-Path Algorithms |
IJCV
2002
13 years 5 months ago
2002
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
ISAAC
2010
Springer
13 years 4 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
ATMOS
2007
13 years 7 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
ICRA
2010
IEEE
13 years 4 months ago
2010
IEEE
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...
WSDM
2009
ACM
14 years 28 days ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...