𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved probability bound for the Approximate S-Lemma

✍ Scribed by Kürşad Derinkuyu; Mustafa Ç. Pınar; Ahmet Camcı

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
122 KB
Volume
35
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some improvements on the Lundberg bound
Some improvements on the Lundberg bound for the ruin probability
✍ Jun Cai; Yanhong Wu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 333 KB

In this paper, improvements on the Lundberg bound for the ruin probability in the classical risk model are considered• First, a lower bound and an upper bound are derived in terms of an NWU and NBU distribution which generalize the Lundberg bound based on the exponential distribution• Second, some n

The complexity of approximating MAPs for
The complexity of approximating MAPs for belief networks with bounded probabilities
✍ Ashraf M. Abdelbar; Stephen T. Hedetniemi; Sandra M. Hedetniemi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 69 KB

Probabilistic inference and maximum a posteriori (MAP) explanation are two important and related problems on Bayesian belief networks. Both problems are known to be NP-hard for both approximation and exact solution. In 1997, Dagum and Luby showed that efficiently approximating probabilistic inferenc

An improved bound for the strong chromat
An improved bound for the strong chromatic number
✍ P. E. Haxell 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB 👁 1 views

## Abstract Let η > 0 be given. Then there exists __d__~0~ = __d__~0~(η) such that the following holds. Let __G__ be a finite graph with maximum degree at most __d__ ≥ __d__~0~ whose vertex set is partitioned into classes of size α __d__, where α≥ 11/4 + η. Then there exists a proper coloring of __