Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,115,107 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.
2016
2016
Model complexities of shallow networks representing highly varying functions
V. Kůrková
,
M. Sanguineti
Neurocomputing
2016
Corpus ID: 13580339
2014
2014
Quantum probes for fractional Gaussian processes
M. Paris
2014
Corpus ID: 118669026
2010
2010
A Simple Recruitment Scheme of Multiple Nodes for Cooperative MAC
F. Verde
,
T. Korakis
,
E. Erkip
,
A. Scaglione
IEEE Transactions on Communications
2010
Corpus ID: 2959905
Physical (PHY) layer cooperation in a wireless network allows neighboring nodes to share their communication resources in order…
Expand
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
Highly Cited
2006
Highly Cited
2006
A false negative approach to mining frequent itemsets from high speed transactional data streams
J. Yu
,
Zhihong Chong
,
Hongjun Lu
,
Zhenjie Zhang
,
Aoying Zhou
Information Sciences
2006
Corpus ID: 12384363
2004
2004
Performance of MIMO antenna selection for space-time coded OFDM systems
I. Bahceci
,
T. Duman
,
Y. Altunbasak
IEEE Wireless Communications and Networking…
2004
Corpus ID: 17220642
This paper studies the antenna selection for space-time coded orthogonal frequency division multiplexing (OFDM) systems that…
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
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
Highly Cited
1980
Highly Cited
1980
Intervals and tenses
P. Roper
Journal of Philosophical Logic
1980
Corpus ID: 38187201
Concluding RemarksNeither question (1) nor question (2) posed on page 446 have been adequately answered in this paper. Regarding…
Expand
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