Sciweavers

473 search results - page 13 / 95
» Computing shortest paths with uncertainty
Sort
View
51
Voted
COMGEO
2004
ACM
14 years 9 months ago
Approximating geometric bottleneck shortest paths
Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, ...
LCN
1999
IEEE
15 years 1 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
HIPC
2003
Springer
15 years 2 months ago
On Shortest Path Routing Schemes for Wireless Ad Hoc Networks
Subhankar Dhar, Michael Q. Rieck, Sukesh Pai
EMMCVPR
2007
Springer
15 years 1 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
IWANN
1997
Springer
15 years 1 months ago
Dynamic Path Planning with Spiking Neural Networks
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
Ulrich Roth, Marc Walker, Arne Hilmann, Heinrich K...