✦ LIBER ✦

Realizability of greedy algorithms

✍ Scribed by E. D. Livshits

Book ID: 110190051
Publisher: SP MAIK Nauka/Interperiodica
Year: 2011
Tongue: English
Weight: 377 KB
Volume: 273
Category: Article
ISSN: 0081-5438
DOI: 10.1134/s0081543811050117

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vector greedy algorithms

✍ Adam Lutoborski; Vladimir N. Temlyakov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Our objective is to study nonlinear approximation with regard to redundant systems. Redundancy on the one hand offers much promise for greater efficiency in terms of approximation rate, but on the other hand gives rise to highly nontrivial theoretical and practical problems. Greedy-type approximatio

Approximate Weak Greedy Algorithms

✍ R. Gribonval; M. Nielsen 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 149 KB

Super greedy type algorithms

✍ Liu, Entao; Temlyakov, Vladimir N. 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 329 KB

Advances in greedy algorithms

✍ Bednorz W. 📂 Library 📅 2008 🌐 English ⚖ 8 MB

Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by author(s). Usually some elementary knowledge is assumed, yet all the required facts are quoted mostly in examples, remark

Greedy and -Greedy Algorithms for Multid

Greedy and -Greedy Algorithms for Multidimensional Data Association

✍ Perea, F.; De Waard, H.W. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 700 KB

Rate of Convergence of Greedy Algorithms

✍ A. V. Sil'nichenko 📂 Article 📅 2004 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 103 KB