763 search results - page 79 / 153 » Engineering Shortest Path Algorithms |
104
click to vote
ISAAC
2003
Springer
15 years 7 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
120
click to vote
STACS
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
99
Voted
NAACL
2007
15 years 3 months ago
2007
This paper describes an efficient method to extract large n-best lists from a word graph produced by a statistical machine translation system. The extraction is based on the k sh...
132
Voted
IJRR
2010
14 years 11 months ago
2010
This paper presents the minimum-time sequences of rotations and translations that connect two configurations of a rigid body in the plane. The configuration of the body is its pos...
115
Voted
CCR
2000
15 years 2 months ago
2000
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...