473 search results - page 62 / 95 » Computing shortest paths with uncertainty |
102
Voted
ICMCS
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we propose an original framework for representing 2D and 3D face information using geodesic distances. This aims to define a representation enabling the direct com...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
ICPR
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a method to construct a mosaic from multiple color and fluorescein retinal images. A set of images taken from different views at different times is difficult to registe...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
75
Voted
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...