1747 search results - page 335 / 350 » Long Range Dependence |
ASPLOS
2008
ACM
14 years 2 days ago
2008
ACM
Commodity operating systems entrusted with securing sensitive data are remarkably large and complex, and consequently, frequently prone to compromise. To address this limitation, ...
CCS
2008
ACM
14 years 2 days ago
2008
ACM
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocol...
APPROX
2010
Springer
13 years 11 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 ...
DAGSTUHL
2007
13 years 11 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
FAST
2007
13 years 11 months ago
2007
Component failure in large-scale IT installations is becoming an ever larger problem as the number of components in a single cluster approaches a million. In this paper, we presen...