103 search results - page 11 / 21 » Computing approximate shortest paths on convex polytopes |
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
WAW
2007
Springer
14 years 25 days ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
HIPC
2007
Springer
13 years 10 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...