✦ LIBER ✦

Greedy Algorithm for General Biorthogonal Systems

✍ Scribed by P. Wojtaszczyk

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 189 KB
Volume: 107
Category: Article
ISSN: 0021-9045
DOI: 10.1006/jath.2000.3512

No coin nor oath required. For personal study only.

✦ Synopsis

We consider biorthogonal systems in quasi-Banach spaces such that the greedy algorithm converges for each x # X (quasi-greedy systems). We construct quasigreedy conditional bases in a wide range of Banach spaces. We also compare the greedy algorithm for the multidimensional Haar system with the optimal m-term approximation for this system. This substantiates a conjecture by Temlyakov.

📜 SIMILAR VOLUMES

Greedy approximation algorithms for dire

Greedy approximation algorithms for directed multicuts

✍ Yana Kortsarts; Guy Kortsarz; Zeev Nutov 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

Improved greedy algorithm for protein st

Improved greedy algorithm for protein structure reconstruction

✍ Pierre Tuffery; Frédéric Guyon; Philippe Derreumaux 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

## Abstract This article concerns the development of an improved greedy algorithm for protein structure reconstruction. Our stochastic greedy algorithm, which attempts to locate the ground state of an approximate energy function, exploits the fact that protein structures consist of overlapping stru

Greedy Algorithms for On-Line Data Compr

Greedy Algorithms for On-Line Data Compression

✍ József Békési; Gábor Galambos; Ulrich Pferschy; Gerhard J Woeginger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 191 KB

We consider on-line text-compression problems where compression is done by Ž . substituting substrings according to some fixed static dictionary code book . Due to the long running time of optimal algorithms, several heuristics have been introduced in the literature. In this paper, we continue the i

Application of new systems techniques an

Application of new systems techniques and the greedy algorithm for reliability data reconstruction

✍ Hamid R. Jafari; Fouad N. Jalbout; Thomas F. Hassett 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB 👁 2 views

The main objective of this paper is to apply new systems techniques for condensing information that is contained in a reliability data set. These techniques, augmented with the Greedy Algorithm, were used to develop an algorithm for reduced data set reconstruction. The techniques go beyond tradition

Note: On the greedy algorithm for optima

Note: On the greedy algorithm for optimal assembly

✍ Laurence A. Baxter; Farid Harche 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

Greedy online algorithms for routing per

Greedy online algorithms for routing permanent virtual circuits

✍ Havill, Jessen T.; Mao, Weizhen 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

We analyze the competitive ratio of two greedy online algorithms for routing permanent virtual circuits in a network with arbitrary topology and uniform capacity links. We show that the competitive ratio of the first algorithm, with respect to network congestion, is in ⍀( ͌ Ᏸm) and O( ͌ Ᏸᏸm), where