The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Vladimir N. Temlyakov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dany Leviatan, Vladimir N. Temlyakov
    Simultaneous approximation by greedy algorithms. [Citation Graph (0, 0)][DBLP]
    Adv. Comput. Math., 2006, v:25, n:1-3, pp:73-90 [Journal]
  2. Ronald A. DeVore, Guergana Petrova, Vladimir N. Temlyakov
    Best Basis Selection for Approximation in Lp. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2003, v:3, n:2, pp:161-185 [Journal]
  3. Vladimir N. Temlyakov
    Nonlinear Methods of Approximation. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2003, v:3, n:1, pp:33-107 [Journal]
  4. Ronald A. DeVore, Gerard Kerkyacharian, Dominique Picard, Vladimir N. Temlyakov
    Approximation Methods for Supervised Learning. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2006, v:6, n:1, pp:3-58 [Journal]
  5. Ronald A. DeVore, Vladimir N. Temlyakov
    Nonlinear Approximation in Finite-Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:4, pp:489-508 [Journal]
  6. Dany Leviatan, Vladimir N. Temlyakov
    Simultaneous greedy approximation in Banach spaces. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:3, pp:275-293 [Journal]
  7. Adam Lutoborski, Vladimir N. Temlyakov
    Vector greedy algorithms. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2003, v:19, n:4, pp:458-473 [Journal]
  8. Vladimir N. Temlyakov
    Cubature formulas, discrepancy, and nonlinear approximation. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2003, v:19, n:3, pp:352-391 [Journal]
  9. Vladimir N. Temlyakov
    On Approximate Recovery of Functions with Bounded Mixed Derivative. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1993, v:9, n:1, pp:41-59 [Journal]
  10. Vladimir N. Temlyakov
    An Inequality for Trigonometric Polynomials and Its Application for Estimating the Entropy Numbers. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1995, v:11, n:2, pp:293-307 [Journal]
  11. Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald A. DeVore, Vladimir N. Temlyakov
    Universal Algorithms for Learning Theory Part I : Piecewise Constant Functions. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2005, v:6, n:, pp:1297-1321 [Journal]
  12. David L. Donoho, Michael Elad, Vladimir N. Temlyakov
    Stable recovery of sparse overcomplete representations in the presence of noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:1, pp:6-18 [Journal]
  13. V. N. Temlyakov
    Greedy expansions in Banach spaces. [Citation Graph (0, 0)][DBLP]
    Adv. Comput. Math., 2007, v:26, n:4, pp:431-449 [Journal]

  14. Some remarks on greedy algorithms. [Citation Graph (, )][DBLP]


  15. Weak greedy algorithms. [Citation Graph (, )][DBLP]


  16. Greedy algorithms in Banach spaces. [Citation Graph (, )][DBLP]


  17. A Criterion for Convergence of Weak Greedy Algorithms. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002