Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,961,554 papers from all fields of science
Search
Sign In
Create Free Account
Chernoff bound
Known as:
Chernoff
, Chernoff's inequality
, Chernoff inequality
Expand
In probability theory, the Chernoff bound, named after Herman Chernoff but due to Herman Rubin, gives exponentially decreasing bounds on tail…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Approximation error
BPP (complexity)
BQP
Binary symmetric channel
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Probing light polarization with the quantum Chernoff bound
I. Ghiu
,
G. Bjork
,
P. Marian
,
T. A. Marian
2010
Corpus ID: 119158563
We recall the framework of a consistent quantum description of polarization of light. Accordingly, the degree of polarization of…
Expand
2009
2009
Chernoff information-based optimization of sensor networks for distributed detection
G. Fabeck
,
R. Mathar
IEEE International Symposium on Signal Processing…
2009
Corpus ID: 11354023
This paper addresses the scalable optimization of sensor networks for distributed detection applications. In the general case…
Expand
2007
2007
Quantum Chernoff bound metric for the XY model at finite temperature
D. Abasto
,
N. Tobias Jacobson
,
P. Zanardi
2007
Corpus ID: 119181669
We explore the finite-temperature phase diagram of the anisotropic XY spin chain using the quantum Chernoff bound metric on…
Expand
2006
2006
Capacity of clustered ad hoc networks: how large is "Large"?
E. Perevalov
,
Rick S. Blum
,
Danny Safi
IEEE Transactions on Communications
2006
Corpus ID: 38068244
We study the capacity of a large clustered wireless ad hoc network in which clusters of nodes are scattered in a sea of…
Expand
2005
2005
Asynchronous Distributed Detection in Sensor Networks ∗
Venkatesh Saligrama Murat Alanyali Onur Savas
2005
Corpus ID: 14364688
We consider the problem of classifying among a set of M hypothesis withN distributed noisy sensors. TheN sensors can collaborate…
Expand
2001
2001
Reconciling simplicity and realism in parallel disk models
P. Sanders
ACM-SIAM Symposium on Discrete Algorithms
2001
Corpus ID: 7833293
1994
1994
Chernoff bound of trellis-coded modulation over correlated fading channels
K. Leeuwin-Boullé
,
J. Belfiore
,
G. K. Kaleh
IEEE Transactions on Communications
1994
Corpus ID: 38239452
We derive a Chernoff upper bound for the pairwise error probability in the presence of an additive white Gaussian noise and a…
Expand
1993
1993
Bootstrapping the change-point of a hazard rate
Tuan D. Pham
,
H. Nguyen
1993
Corpus ID: 54987913
This paper concerns the asymptotic validity of the bootstrap method in a non-regular model. Specifically, it is shown that the…
Expand
1990
1990
Relationship between the saddlepoint approximation and the modified Chernoff bound [optical communication]
K. Schumacher
,
J. O'Reilly
IEEE Transactions on Communications
1990
Corpus ID: 37871644
A comparison is made of two methods for the computation of the probability that the sum of a Gaussian and a nonGaussian random…
Expand
1978
1978
SOME APPLICATIONS OF THE “CHERNOFF FACES”: A TECHNIQUE FOR GRAPHICALLY REPRESENTING MULTIVARIATE DATA
G. C. McDonald
,
J. A. Ayers
1978
Corpus ID: 59648871
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE