126 citations to 10.1023/A:1018917218956 (Crossref Cited-By Service)
  1. Ruey S. Tsay, Tomohiro Ando, “Penalized Maximum Likelihood Boosting with Predictive Measures”, Ouyou toukeigaku, 38, № 2, 2009, 41  crossref
  2. Yang Tao, Wenbo Zhang, Yifei Zhao, Christos Ktistis, Wuliang Yin, Anthony J. Peyton, 2016 IEEE International Instrumentation and Measurement Technology Conference Proceedings, 2016, 1  crossref
  3. V. V. Galatenko, E. D. Livshits, “Generalized Approximate Weak Greedy Algorithms”, Math Notes, 78, № 1-2, 2005, 170  crossref
  4. Xiu Yang, George Em Karniadakis, “Reweighted minimization method for stochastic elliptic differential equations”, Journal of Computational Physics, 248, 2013, 87  crossref
  5. Владимир Владимирович Галатенко, Vladimir Vladimirovich Galatenko, “Об орторекурсивном разложении с ошибками в вычислении коэффициентов”, Изв. РАН. Сер. матем., 69, № 1, 2005, 3  crossref
  6. D.L. Donoho, M. Elad, V.N. Temlyakov, “On Lebesgue-type inequalities for greedy approximation”, Journal of Approximation Theory, 147, № 2, 2007, 185  crossref
  7. Yuwen Li, Jonathan W. Siegel, “Entropy-based convergence rates of greedy algorithms”, Math. Models Methods Appl. Sci., 34, № 05, 2024, 779  crossref
  8. D. Leviatan, V.N. Temlyakov, “Simultaneous greedy approximation in Banach spaces”, Journal of Complexity, 21, № 3, 2005, 275  crossref
  9. Jürgen Seiler, André Kaup, “Motion Compensated Three-Dimensional Frequency Selective Extrapolation for improved error concealment in video communication”, Journal of Visual Communication and Image Representation, 22, № 3, 2011, 213  crossref
  10. Adam Lutoborski, Vladimir N. Temlyakov, “Vector greedy algorithms”, Journal of Complexity, 19, № 4, 2003, 458  crossref
Предыдущая
1
2
3
4
5
6
7
13
Следующая