9 citations · 17 across the 4 of their papers we have counts for
1 paper · 1 filter
Eugene Livshitz, Vladimir Temlyakov
We study sparse approximation by greedy algorithms. Our contribution is two-fold. First, we prove exact recovery with high probability of random K-sparse signals within $\lceil K…