Sciweavers

48 search results - page 10 / 10
» A wide-range algorithm for minimal triangulation from an arb...
Sort
View
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 5 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
13 years 10 months ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin
SIROCCO
2008
13 years 6 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...