The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Vladimir N. Temlyakov" ( http://dblp.L3S.de/Authors/Vladimir_N._Temlyakov )

  Author page on DBLP  Author page in RDF  Community of Vladimir N. Temlyakov in ASPL-2

Publication years (Num. hits)
1993-2006 (17) 2007-2012 (7)
Publication types (Num. hits)
article(24)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 20 occurrences of 16 keywords

Results
Found 24 publication records. Showing 24 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Dmitriy Bilyk, Vladimir N. Temlyakov, Rui Yu Fibonacci sets and symmetrization in discrepancy theory. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Entao Liu, Vladimir N. Temlyakov The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1J. L. Nelson, Vladimir N. Temlyakov On the size of incoherent systems. Search on Bibsonomy Journal of Approximation Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vladimir N. Temlyakov, Pavel Zheltov On performance of greedy algorithms. Search on Bibsonomy Journal of Approximation Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vladimir N. Temlyakov, Mingrui Yang, Peixin Ye Greedy approximation with regard to non-greedy bases. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1David L. Donoho, Michael Elad, Vladimir N. Temlyakov On Lebesgue-type inequalities for greedy approximation. Search on Bibsonomy Journal of Approximation Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Vladimir N. Temlyakov Greedy expansions in Banach spaces. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics subject classifications (2000) 41A65, 42A10
1Ronald A. DeVore, Gerard Kerkyacharian, Dominique Picard, Vladimir N. Temlyakov Approximation Methods for Supervised Learning. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Nonlinear methods, Upper and lower estimates, Entropy, Learning theory, Regression estimation
1Dany Leviatan, Vladimir N. Temlyakov Simultaneous approximation by greedy algorithms. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF simultaneous approximation, convergence, greedy algorithms
1David L. Donoho, Michael Elad, Vladimir N. Temlyakov Stable recovery of sparse overcomplete representations in the presence of noise. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Dany Leviatan, Vladimir N. Temlyakov Simultaneous greedy approximation in Banach spaces. Search on Bibsonomy J. Complexity The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald A. DeVore, Vladimir N. Temlyakov Universal Algorithms for Learning Theory Part I : Piecewise Constant Functions. Search on Bibsonomy Journal of Machine Learning Research The full citation details ... 2005 DBLP  BibTeX  RDF
1Vladimir N. Temlyakov Nonlinear Methods of Approximation. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF AMS Classification. 41A17, 41A46, 41A65, 42A10, 46A35, 46C99, 46N40, 65J05, 41A25, 42C15, 65D15, 42C10, 46E35
1Ronald A. DeVore, Guergana Petrova, Vladimir N. Temlyakov Best Basis Selection for Approximation in Lp. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Best basis, n -Term approximation, Degree of approximation, Approximation classes, Democratic bases, Unconditional bases, Greedy bases, AMS Classification. 42C40, 46B70, 26B35, 42B25
1Vladimir N. Temlyakov Cubature formulas, discrepancy, and nonlinear approximation. Search on Bibsonomy J. Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Adam Lutoborski, Vladimir N. Temlyakov Vector greedy algorithms. Search on Bibsonomy J. Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Vladimir N. Temlyakov A Criterion for Convergence of Weak Greedy Algorithms. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF convergence, greedy algorithm, dictionary, Hilbert space
1Vladimir N. Temlyakov Greedy algorithms in Banach spaces. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF convergence, greedy algorithm, nonlinear approximation, redundant systems, best approximation, Banach space
1Vladimir N. Temlyakov Weak greedy algorithms. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Vladimir N. Temlyakov The best m-term approximation and greedy algorithms. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Ronald A. DeVore, Vladimir N. Temlyakov Nonlinear Approximation in Finite-Dimensional Spaces. Search on Bibsonomy J. Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Ronald A. DeVore, Vladimir N. Temlyakov Some remarks on greedy algorithms. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Vladimir N. Temlyakov An Inequality for Trigonometric Polynomials and Its Application for Estimating the Entropy Numbers. Search on Bibsonomy J. Complexity The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Vladimir N. Temlyakov On Approximate Recovery of Functions with Bounded Mixed Derivative. Search on Bibsonomy J. Complexity The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #24 of 24 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.