Sciweavers

23 search results - page 1 / 5
» Experimental analysis of dynamic all pairs shortest path alg...
Sort
View
SODA
2004
ACM
76views Algorithms» more  SODA 2004»
13 years 6 months ago
Experimental analysis of dynamic all pairs shortest path algorithms
Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. I...
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 5 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
PPSN
2010
Springer
13 years 2 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
FCCM
2006
IEEE
107views VLSI» more  FCCM 2006»
13 years 10 months ago
Hardware/Software Integration for FPGA-based All-Pairs Shortest-Paths
Field-Programmable Gate Arrays (FPGAs) are being employed in high performance computing systems owing to their potential to accelerate a wide variety of long-running routines. Par...
Uday Bondhugula, Ananth Devulapalli, James Dinan, ...
IJCV
2002
156views more  IJCV 2002»
13 years 4 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal