16 search results - page 1 / 4 » Chernoff-Hoeffding Bounds for Applications with Limited Inde... |
SODA
1993
ACM
13 years 6 months ago
1993
ACM
APPROX
2010
Springer
13 years 7 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 ...
KDD
1998
ACM
13 years 9 months ago
1998
ACM
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
ECRTS
2003
IEEE
13 years 11 months ago
2003
IEEE
Utilization bounds for schedulability of aperiodic tasks are new in real-time scheduling literature. All aperiodic bounds known to date apply only to independent tasks. They eithe...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...