✦ LIBER ✦

Probabilistic robustness analysis: Explicit bounds for the minimum number of samples

✍ Scribed by R. Tempo; E.W. Bai; F. Dabbene

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 387 KB
Volume: 30
Category: Article
ISSN: 0167-6911
DOI: 10.1016/s0167-6911(97)00005-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

General Bounds on the Number of Examples

General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts

✍ Hans Ulrich Simon 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 631 KB

Given a p-concept class C, we define two important functions d C (#), d$ C (#) (related to the notion of #-shattering). We prove a lower bound of 0((d C (#)&1)Â(=# 2 )) on the number of examples required for learning C with an (=, #)-good model of probability. We prove similar lower bounds for some

Bounds for the minimum numbers of genera

Bounds for the minimum numbers of generators of generalized Cohen-Macaulay ideals

✍ Ngo Viet Trung 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 374 KB

New Bounds for the Extreme Values of a F

New Bounds for the Extreme Values of a Finite Sample of Real Numbers

✍ Jean-Pierre Crouzeix; Alberto Seeger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Explicit integration of bounding surface

Explicit integration of bounding surface model for the analysis of earthquake soil liquefaction

✍ Konstantinos I. Andrianopoulos; Achilleas G. Papadimitriou; George D. Bouckovala 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 829 KB

An upper bound for the number of polynom

An upper bound for the number of polynomials in Markov binomial sampling plans

✍ Chorneyko, I. 📂 Article 📅 1963 🏛 Wiley (John Wiley & Sons) ⚖ 197 KB 👁 1 views

Probabilistic analysis of an lp relaxati

Probabilistic analysis of an lp relaxation bound for the steiner problem in networks

✍ Anjani Jain 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 395 KB