✦ LIBER ✦

Improved Risk Tail Bounds for On-Line Algorithms

✍ Scribed by Cesa-Bianchi, N.; Gentile, C.

Book ID: 114640997
Publisher: IEEE
Year: 2008
Tongue: English
Weight: 204 KB
Volume: 54
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2007.911292

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Bounds on Quantum Learning Algo

Improved Bounds on Quantum Learning Algorithms

✍ Alp Atici; Rocco A. Servedio 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 269 KB

Improved Bounds for On-Line Load Balanci

Improved Bounds for On-Line Load Balancing

✍ M. Andrews; M. X. Goemans; L. Zhang 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 266 KB

An improved lower bound for on-line bin

An improved lower bound for on-line bin packing algorithms

✍ André van Vliet 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Lower bounds for on-line two-dimensional

Lower bounds for on-line two-dimensional packing algorithms

✍ Donna J. Brown; Brenda S. Baker; Howard P. Katseff 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 663 KB

Improved bounds and algorithms for hyper

Improved bounds and algorithms for hypergraph 2-coloring

✍ Jaikumar Radhakrishnan; Aravind Srinivasan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB 👁 2 views

We show that for all large n, every n-uniform hypergraph with at most 0 7 n/ ln n × 2 n edges can be 2-colored. This makes progress on a problem of Erdős [Nordisk Mat. Tidskrift 11, 5-10 (1963)], improving the previous-best bound of n 1/3-o 1 × 2 n due to Beck [Discrete Math. 24, 127-137 (1978)]. We

Improved complexity bounds for location

Improved complexity bounds for location problems on the real line

✍ R. Hassin; A. Tamir 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 387 KB