2252 search results - page 378 / 451 » Lower Bounds for Dynamic Algorithms |
168
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
143
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
160
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
150
click to vote
ALMOB
2008
15 years 6 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
174
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...