Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  upper and lower bounds
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Variance upper bounds and a probability inequality for discrete α-unimodality

100%
EN
Variance upper bounds for discrete α-unimodal distributions defined on a finite support are established. These bounds depend on the support and the unimodality index α. They increase as the unimodality index α increases. More information about the underlying distributions yields tighter upper bounds for the variance. A parameter-free Bernstein-type upper bound is derived for the probability that the sum S of n independent and identically distributed discrete α-unimodal random variables exceeds its mean E(S) by a positive value nt. The bound for P{S-nμ ≥ nt} depends on the range of the summands, the sample size n, the unimodality index α and the positive number t.
2
Content available remote

Thinnest Covering of the Euclidean Plane with Incongruent Circles

88%
EN
In 1958 L. Fejes Tóth and J. Molnar proposed a conjecture about a lower bound for the thinnest covering of the plane by circles with arbitrary radii from a given interval of the reals. If only two kinds of radii can occur this conjecture was in essence proven by A. Florian in 1962, leaving the general case unanswered till now. The goal of this paper is to analytically describe the general case in such a way that the conjecture can easily be numerically verified and upper and lower limits for the asserted bound can be gained.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.