On greedy algorithms for dictionaries with bounded cumulative coherence

被引：1
|
作者：
Livshits, E. D. [1 ]
机构：
[1] Evernote Corp, Moscow, Russia
来源：
MATHEMATICAL NOTES | 2010年 / 87卷 / 5-6期
基金：
俄罗斯基础研究基金会;
关键词：
greedy algorithm; pure greedy algorithm; orthogonal greedy algorithm; sparse approximation; cumulative coherence of a dictionary; Hilbert space; REPRESENTATIONS; APPROXIMATION;
D O I：
10.1134/S0001434610050159
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
[No abstract available]
引用
收藏
页码：774 / 778
页数：5
相关论文
共 50 条
  • [41] Greedy algorithms in coding theory
    Cohen, G
    Litsyn, S
    Zemor, G
    NINETEENTH CONVENTION OF ELECTRICAL AND ELECTRONICS ENGINEERS IN ISRAEL, 1996, : 333 - 335
  • [42] On greedy algorithms in coding theory
    Cohen, GD
    Litsyn, S
    Zemor, G
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) : 2053 - 2057
  • [43] On Greedy Algorithms for Decision Trees
    Cicalese, Ferdinando
    Jacobs, Tobias
    Laber, Eduardo
    Molinaro, Marco
    ALGORITHMS AND COMPUTATION, PT 2, 2010, 6507 : 206 - +
  • [44] Greedy algorithms in Banach spaces
    V.N. Temlyakov
    Advances in Computational Mathematics, 2001, 14 : 277 - 292
  • [45] Fast greedy triangulation algorithms
    Dickerson, MT
    Drysdale, RLS
    McElfresh, SA
    Welzl, E
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 8 (02): : 67 - 86
  • [46] On the power of random greedy algorithms
    Guo, He
    Warnke, Lutz
    EUROPEAN JOURNAL OF COMBINATORICS, 2022, 105
  • [47] Super greedy type algorithms
    Liu, Entao
    Temlyakov, Vladimir N.
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2012, 37 (04) : 493 - 504
  • [48] FAST ALGORITHMS FOR GREEDY TRIANGULATION
    LEVCOPOULOS, C
    LINGAS, A
    BIT, 1992, 32 (02): : 280 - 296
  • [49] Sparse Approximation by Greedy Algorithms
    Temlyakov, V.
    MATHEMATICAL ANALYSIS, PROBABILITY AND APPLICATIONS - PLENARY LECTURES, 2016, 177 : 183 - 215
  • [50] Some remarks on greedy algorithms
    DeVore, RA
    Temlyakov, VN
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 1996, 5 (2-3) : 173 - 187
12345