𝔖 Bobbio Scriptorium
✦   LIBER   ✦

K-greedy algorithms for independence systems

✍ Scribed by D. Hausmann; B. Korte

Publisher
Springer
Year
1978
Tongue
English
Weight
367 KB
Volume
22
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Greedy Algorithm for General Biorthogona
Greedy Algorithm for General Biorthogonal Systems
✍ P. Wojtaszczyk πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 189 KB

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 opti

Hereditary systems and greedy-type algor
Hereditary systems and greedy-type algorithms
✍ Victor Il'ev πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 167 KB

We deÿne a hereditary system on a ÿnite set U as a partition of the family 2 U of all subsets of U into disjoint families A and D satisfying (A ∈ A; respectively. The members of A are called independent sets, the sets D ∈ D are called dependent. We consider two important special cases of hereditary

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