763 search results - page 5 / 153 » Engineering Shortest Path Algorithms |
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
JCM
2007
13 years 7 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
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...
HIPC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...