467 search results - page 7 / 94 » Acceleration of Shortest Path and Constrained Shortest Path ... |
CAINE
2004
13 years 8 months ago
2004
The problem of finding a shortest path is common to many different fields including transportation systems, mechanical systems and computer communications. Most telecommunication ...
STACS
2010
Springer
14 years 15 days ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
CP
2003
Springer
14 years 18 days ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
We present a new semi-automatic segmentation tool, which is motivated by the Intelligent Scissors algorithm [1], but which uses a modified concept of user-interaction. This new in...
PVLDB
2010
13 years 5 months ago
2010
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...