In probability theory, the Chernoff bound, named after Herman Chernoff but due to Herman Rubin, gives exponentially decreasing bounds on tail… (More)

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

- Maya Thangavelu, Rosa María Raich
- 2008 IEEE Workshop on Machine Learning for Signal…
- 2008

In this paper, we consider the problem of linear dimension reduction (LDR) for multiclass classification. Often, a linear… (More)

Is this relevant?

2008

2008

- Avi Wigderson, David Xiao
- Theory of Computing
- 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

- Yi Wu, Keijo Ruotsalainen, Markku J. Juntti
- IEEE Transactions on Information Theory
- 2008

Unitary space-time constellation design is considered for noncoherent multiple-antenna communications, where neither the… (More)

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)

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)

Is this relevant?

2003

2003

- Vladislav Kargin
- 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

- K. Leeuwin-Boullé, Jean-Claude Belfiore, Ghassan Kawas Kaleh
- IEEE Trans. Communications
- 1994

N radio and satellite channels, system performance is 0 degraded by Rician or Rayleigh fading resulting from multipath… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- David Gillman
- FOCS
- 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)

Is this relevant?

Highly Cited

1970

Highly Cited

1970

- Martin E. Hellman, Josef Raviv
- IEEE Trans. Information Theory
- 1970

-I4 ET US consider the usual decision-theory problem of classifying an observation X ss coming from one of m possible classes… (More)

Is this relevant?