✦ LIBER ✦

A sharp upper bound for the expected number of false rejections

✍ Scribed by Alexander Y. Gordon

Book ID: 116890479
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 225 KB
Volume: 82
Category: Article
ISSN: 0167-7152
DOI: 10.1016/j.spl.2012.03.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A sharp false alarm upper-bound for a ma

A sharp false alarm upper-bound for a matched filter bank detector

✍ Gerlach, K.; Sangston, K.J. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 591 KB

A Sharp Upper Bound for the Number of Sp

A Sharp Upper Bound for the Number of Spanning Trees of a Graph

✍ Kinkar Ch. Das 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 85 KB

An upper bound for the expected number o

An upper bound for the expected number of real zeros of a random polynomial

✍ J.Ernest Wilkins Jr. 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 312 KB

A Sharp Bound for the Marginal Appendage

A Sharp Bound for the Marginal Appendage Number

✍ Garry L. Johns 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 400 KB

A sharp upper bound for the number of st

A sharp upper bound for the number of stable sets in graphs with given number of cut edges

✍ Hongbo Hua 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.

A selection algorithm with a practical u

A selection algorithm with a practical upper bound on expected number of comparisons

✍ Jong Soo Park; Myunghwan Kim 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB