Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SODA
1993
ACM

favoriteEmaildiscussreport

107views Algorithms» more SODA 1993»

Chernoff-Hoeffding Bounds for Applications with Limited Independence

13 years 6 months ago

Chernoff-Hoeffding Bounds for Applications with Limited Independence

Download www.cs.umd.edu

Jeanette P. Schmidt, Alan Siegel, Aravind Srinivas

Real-time Traffic

Algorithms | SODA 1993 |

claim paper

Related Content

» Constructive Proofs of Concentration Bounds

» Coincidence Detection A Fast Method for Discovering HigherOrder Correlations in Multidimen...

» A Synthetic Utilization Bound for Aperiodic Tasks with Resource Requirements

» The price of privacy and the limits of LP decoding

» An asymptotically constant linearly bounded methodology for the statistical simulation of ...

» Codes for asymmetric limitedmagnitude errors with application to multilevel flash memories

» Completely decentralised navigation of multiple unicycle agents with prioritisation and fa...

» Negative thinking by incremental problem solving application to unate covering

» Mining complex models from arbitrarily large databases in constant time

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1993
Where	SODA
Authors	Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan

Comments (0)