A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
Dereventsov, A. V. (author)
MATHEMATICAL NOTES -NEW YORK- C/C OF MATEMATICHESKIE ZAMETIK ; 92 ; 485-489
2012-01-01
5 pages
Article (Journal)
English
DDC:
510
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
On the convergence of order-preserving weak greedy algorithms
| British Library Online Contents | 2008
Greedy Algorithms for Scheduling Workers
| British Library Conference Proceedings | 1996
Generalized Approximate Weak Greedy Algorithms
| British Library Online Contents | 2005
The Thresholding Greedy Algorithm, Greedy Bases, and Duality
| British Library Online Contents | 2003
Greedy Algorithms for High-Dimensional Eigenvalue Problems
| British Library Online Contents | 2014