473 search results - page 5 / 95 » Computing shortest paths with uncertainty |
STACS
2010
Springer
15 years 2 months 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 ...
ICIP
2004
IEEE
15 years 11 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...
SSD
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
77
Voted
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
94
Voted
ICDCS
2011
IEEE
13 years 9 months ago
2011
IEEE
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...