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
β¦ LIBER β¦
Neighbor Systems and the Greedy Algorithm
β Scribed by Hartvigsen, David
- Book ID
- 118197848
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2010
- Tongue
- English
- Weight
- 394 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0895-4801
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Hereditary systems and greedy-type algor
β
Victor Il'ev
π
Article
π
2003
π
Elsevier Science
π
English
β 167 KB
Greedy Algorithm for General Biorthogona
β
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
The Thresholding Greedy Algorithm, Greed
β
S.J. Dilworth; N.J. Kalton; Denka Kutzarova; V.N. Temlyakov
π
Article
π
2003
π
Springer
π
English
β 199 KB
Matroids and the greedy algorithm
β
Jack Edmonds
π
Article
π
1971
π
Springer-Verlag
π
English
β 578 KB
K-greedy algorithms for independence sys
β
D. Hausmann; B. Korte
π
Article
π
1978
π
Springer
π
English
β 367 KB
On the greedy algorithm by the Haar syst
β
H. Aleksanyan
π
Article
π
2010
π
Allerton Press, Inc.
π
English
β 531 KB