473 search results - page 42 / 95 » Computing shortest paths with uncertainty |
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
When studying a 3D polyhedron, it is often easier to cut it open and
atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper presents a new method to extract a network of vessels centerlines from a medical
image. The network is composed of local geodesics over a four-dimensional space that in...
ICPP
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
72
Voted
AINA
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predict...