Back to Results
First PageMeta Content
Fourier analysis / Analysis of algorithms / Digital signal processing / Joseph Fourier / Unitary operators / Fast Fourier transform / Discrete Fourier transform / Fourier transform / Big O notation / Mathematical analysis / Mathematics / Theoretical computer science


Nearly Optimal Sparse Fourier Transform Haitham Hassanieh MIT Piotr Indyk MIT
Add to Reading List

Document Date: 2012-07-08 20:42:16


Open Document

File Size: 411,06 KB

Share Result on Facebook

/

IndustryTerm

above algorithms / actual algorithm / t-ary search / coordinate-wise product / similarity search / signal processing / sparse recovery algorithm / wireless technologies / prior algorithms / /

Organization

MIT / /

Person

ASH T O B INS / Piotr Indyk / Dina Katabi / Eric Price / /

Technology

DFT algorithm / above algorithms / sparse Fourier algorithms / wireless technologies / overarching algorithm / 3 Algorithm / MPEG / DFT algorithms / JPEG / sublinear sparse Fourier algorithms / aforementioned algorithms / 9 4 Algorithm / frequency division multiplexing / 1 The algorithm / time algorithm / actual algorithm / sparse recovery algorithm / existing algorithms / /

SocialTag