83 search results - page 4 / 17 » Two techniques for fast computation of constrained shortest ... |
EMMCVPR
2003
Springer
14 years 20 days ago
2003
Springer
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
DSN
2003
IEEE
14 years 22 days ago
2003
IEEE
—We formulate a notion of local stabilization, by which a system self-stabilizes in time proportional to the size of any perturbation that changes the network topology or the sta...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper addresses a constrained two-terminal reliability measure referred to as Distance Reliability (DR) between the source node u and the destination node I with the shortest...
PAMI
2010
13 years 5 months ago
2010
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Presentation
In robotic navigation, path planning is aimed at getting the optimum collision-free
path between a starting and target locations. The optimality criterion depends on
the surround...