Sciweavers

597 search results - page 30 / 120
» Homomorphisms of random paths
Sort
View
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
15 years 11 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
ITC
2003
IEEE
170views Hardware» more  ITC 2003»
15 years 11 months ago
Double-Tree Scan: A Novel Low-Power Scan-Path Architecture
In a scan-based system with a large number of flip-flops, a major component of power is consumed during scanshift and clocking operation in test mode. In this paper, a novel scan-...
Bhargab B. Bhattacharya, Sharad C. Seth, Sheng Zha...
AIPS
2006
15 years 7 months ago
Reconfigurable Path Planning for an Autonomous Unmanned Aerial Vehicle
In this paper, we present a motion planning framework for a fully deployed autonomous unmanned aerial vehicle which integrates two sample-based motion planning techniques, Probabi...
Mariusz Wzorek, Patrick Doherty
RSA
2010
89views more  RSA 2010»
15 years 4 months ago
Edge flows in the complete random-lengths network
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
David J. Aldous, Shankar Bhamidi
ICDE
2009
IEEE
143views Database» more  ICDE 2009»
16 years 7 months ago
Join Reordering by Join Simulation
We introduce a framework for reordering join pipelines at runtime in a database system. This framework incorporates novel techniques for simulating the execution of a join pipeline...
Chaitanya Mishra, Nick Koudas