Comparison of Pure Greedy Algorithm with Pure Greedy Algorithm in a Pair of Dictionaries

被引:0
|
作者
A. S. Orlova
机构
[1] Chair of Mathematical Analysis,
[2] Faculty of Mechanics and Mathematics,undefined
[3] Lomonosov Moscow State University,undefined
来源
关键词
pure greedy algorithm; pure greedy algorithm in a pair of dictionaries; convergence; convergence rate;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:57 / 66
页数:9
相关论文
共 50 条