Skip to search formSkip to main contentSkip to account menu

Chernoff bound

Known as: Chernoff, Chernoff's inequality, Chernoff inequality 
In probability theory, the Chernoff bound, named after Herman Chernoff but due to Herman Rubin, gives exponentially decreasing bounds on tail… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The vulnerability of cryptographic devices to side-channel attacks is of interest in the domain of information security. The… 
2005
2005
We consider the problem of classifying among a set of M hypothesis withN distributed noisy sensors. TheN sensors can collaborate… 
2004
2004
This paper studies the antenna selection for space-time coded orthogonal frequency division multiplexing (OFDM) systems that… 
2004
2004
An analytical formulation of the outage probability in terms of bit error rate specification for variable bit rate (VBR… 
2003
2003
Concepts of metadata visualization have been developed in order to help users in understanding of metadata about geographic… 
2003
2003
Les plusieurs algorithmes pour faire la quete d'itemsets frequents dans une base de donees dependent de la grandeur de la base de… 
1990
1990
A comparison is made of two methods for the computation of the probability that the sum of a Gaussian and a nonGaussian random… 
1980
1980
The classical Shannon-McMillan's fundamental limit theorem concerns the asymptotic behaviour of the probability of n-letter… 
Review
1978
Review
1978
248 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-24, NO. 2, MARCH 1978 automaton that is close to optimal and eliminates the…