Sciweavers

763 search results - page 33 / 153
» Engineering Shortest Path Algorithms
Sort
View
EMMCVPR
2007
Springer
13 years 11 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, ...
BMCBI
2007
143views more  BMCBI 2007»
13 years 7 months ago
RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
Yair Horesh, Tirza Doniger, Shulamit Michaeli, Ron...
CCCG
1993
13 years 9 months ago
Shortest Paths for a Two-robot Rendez-vous
In this paper, we consider an optimalmotionplanning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the rob...
Erik L. Wynters, Joseph S. B. Mitchell
INFOCOM
2009
IEEE
14 years 2 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 7 months ago
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
Éric Colin de Verdière, Alexander Sc...