Sciweavers

302 search results - page 17 / 61
» Efficient Algorithms for the Longest Path Problem
Sort
View
TKDE
2002
239views more  TKDE 2002»
13 years 8 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
EMMCVPR
2007
Springer
14 years 15 days 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, ...
NETWORKS
2008
13 years 8 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
JCB
2000
91views more  JCB 2000»
13 years 8 months ago
Scaling Laws and Similarity Detection in Sequence Alignment with Gaps
We study the problem of similarity detection by sequence alignment with gaps, using a recently established theoretical framework based on the morphology of alignment paths. Alignm...
Dirk Drasdo, Terence Hwa, Michael Lässig
ACTA
2010
191views more  ACTA 2010»
13 years 8 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar