2168 search results - page 232 / 434 » Randomized Algorithms and Complexity Theory |
125
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
101
Voted
WWW
2006
ACM
16 years 4 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
147
Voted
IPSN
2004
Springer
15 years 9 months ago
2004
Springer
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
109
Voted
DAC
2010
ACM
15 years 7 months ago
2010
ACM
With the end of clock-frequency scaling, parallelism has emerged as the key driver of chip-performance growth. Yet, several factors undermine efficient simultaneous use of onchip ...
151
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...