Back to Results
First PageMeta Content
NP-complete problems / Complexity classes / Combinatorial optimization / Approximation algorithm / NP / Set cover problem / Reduction / Matching pursuit / Matching / Theoretical computer science / Computational complexity theory / Applied mathematics


Adaptive Greedy Approximations1 Geo rey Davis Mathematics Department, Dartmouth College Hanover, NHStephane Mallat, Marco Avellaneda
Add to Reading List

Open Document

File Size: 585,32 KB

Share Result on Facebook

City

New York / /

Company

3M / /

/

Facility

Marco Avellaneda Courant Institute / New York University / /

IndustryTerm

polynomial time algorithms / maximal inner products / audio signal processing / greedy algorithms / inner product / approximation algorithm / inner products / pursuit algorithm / greedy algorithm / energy conservation relation / greedy matching pursuit algorithm / overall algorithm / non-zero inner products / data compression applications / Equivalent algorithms / energy / /

Organization

Marco Avellaneda Courant Institute / Alfred Sloan Foundation / New York University / Dartmouth College / /

/

Position

Travelling Salesman / salesman / /

ProvinceOrState

New York / New Hampshire / /

Technology

greedy matching pursuit algorithm / matching pursuit algorithm / overall algorithm / approximation algorithm / greedy algorithm / polynomial time algorithms / denoising algorithm / /

SocialTag