Search the dblp DataBase
Vladimir N. Temlyakov :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Adam Lutoborski , Vladimir N. Temlyakov Vector greedy algorithms. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2003, v:19, n:4, pp:458-473 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Some remarks on greedy algorithms. [Citation Graph (, )][DBLP ] Weak greedy algorithms. [Citation Graph (, )][DBLP ] Greedy algorithms in Banach spaces. [Citation Graph (, )][DBLP ] A Criterion for Convergence of Weak Greedy Algorithms. [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.007secs