On Greedy Algorithms with bounded cumulative coherence

Details On Greedy Algorithms with bounded cumulative coherence On Greedy Algorithms with bounded cumulative coherence

2009-11-08

arxiv.org/abs/0911.1500v1

Mathematics

Numerical Analysis

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

On Greedy Algorithms with bounded cumulative coherence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Greedy Algorithms with bounded cumulative coherence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Greedy Algorithms with bounded cumulative coherence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-686267