◍wovepaper
SearchResearchersInstitutions
Sign in
math.NANov 8, 2009
4
citations (OpenAlex)
authors
  • Eugene Livshitz
arXiv abstractPDF
paper

On Greedy Algorithms with bounded cumulative coherence

arXiv:0911.1500

Abstract

We discuss the upper and lower estimates for the rate of convergence of Pure and Orthogonal Greedy Algorithms for dictionary with bounded cumulative coherence.

Cited by in corpus (1)

  • On the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.