Chernoff bound

Known as: Chernoff's inequality, Chernoff inequality, Matrix chernoff bound 
In probability theory, the Chernoff bound, named after Herman Chernoff but due to Herman Rubin, gives exponentially decreasing bounds on tail… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1967-2017
0102019672017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
  • BY MICHAEL NUSSBAUM, ARLETA SZKOŁA
  • 2009
We consider symmetric hypothesis testing in quantum statistics, where the hypotheses are density operators on a finite… (More)
Is this relevant?
2008
2008
In this paper, we consider the problem of linear dimension reduction (LDR) for multiclass classification. Often, a linear… (More)
  • figure 1
  • table 2
  • table 1
  • figure 2
  • figure 3
Is this relevant?
2008
2008
Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non… (More)
Is this relevant?
2008
2008
Unitary space-time constellation design is considered for noncoherent multiple-antenna communications, where neither the… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2005
2005
This paper describes the construction of a lower bound for the tails of general random variables, using solely knowledge of their… (More)
  • figure 1
Is this relevant?
2004
2004
  • Jianjun Ni
  • 2004 IEEE Wireless Communications and Networking…
  • 2004
In this paper, we derive the Chernoff bound for linear-quadratic (LQ) receivers and discuss its applications in CDMA fading… (More)
  • figure 1
Is this relevant?
2003
2003
The paper estimates the Chernoff rate for the efficiency of quantum hypothesis testing. For both joint and separable measurements… (More)
Is this relevant?
1994
1994
N radio and satellite channels, system performance is 0 degraded by Rician or Rayleigh fading resulting from multipath… (More)
  • table I
  • figure 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We consider a finite random walk on a weighted graph G; we show that the fraction of time spent in a set of vertices A converges… (More)
  • table 3.1
Is this relevant?
Highly Cited
1970
Highly Cited
1970
-I4 ET US consider the usual decision-theory problem of classifying an observation X ss coming from one of m possible classes… (More)
  • figure 1
Is this relevant?