Sciweavers

707 search results - page 27 / 142
» Solving path problems on the GPU
Sort
View
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 1 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
STACS
2010
Springer
15 years 8 months ago
On Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
Felix Brandt, Felix A. Fischer, Markus Holzer
SIROCCO
2004
15 years 2 months ago
Two-Hop Virtual Path Layout in Tori
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a...
Sébastien Choplin, Lata Narayanan, Jaroslav...
CORR
2007
Springer
133views Education» more  CORR 2007»
15 years 1 months ago
Space and camera path reconstruction for omni-directional vision
In this paper, we address the inverse problem of reconstructing a scene as well as the camera motion from the image sequence taken by an omni-directional camera. Our structure fro...
Oliver Knill, Jose Ramirez-Herran
CORR
2008
Springer
133views Education» more  CORR 2008»
15 years 1 months ago
Approximation Algorithms for Shortest Descending Paths in Terrains
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw...