1510 search results - page 285 / 302 » Upper Probabilities and Additivity |
APPROX
2010
Springer
14 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 ...
NIPS
2007
14 years 11 months ago
2007
It is becoming increasingly evident that organisms acting in uncertain dynamical environments often employ exact or approximate Bayesian statistical calculations in order to conti...
AAAI
2006
14 years 11 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
CSREASAM
2006
14 years 11 months ago
2006
Current computer security systems are based on the premise that once a user presents valid credentials to the authentication system (e.g. valid ID and password), they are granted ...
BDA
2003
14 years 11 months ago
2003
Mobile environments are characterized by high variability (e.g. variable bandwidth, disconnections, different communication prices) as well as by limited mobile host resources. Suc...