Nearly Optimal Sparse Fourier Transform · HackerPapers discussions

Nearly Optimal Sparse Fourier Transform — mentioned by evanb

Sat, 21 Dec 2013 16:38:36 GMT

Link to the abstract: http://arxiv.org/abs/1201.2501

Paper and discussion history. A mention is not an endorsement.

Nearly Optimal Sparse Fourier Transform — HN submission

Sat, 21 Dec 2013 16:05:58 GMT

Nearly Optimal Sparse Fourier Transform

10 points; 5 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Nearly Optimal Sparse Fourier Transform — mentioned by ihodes

Mon, 07 May 2012 18:43:49 GMT

Paper at: http://arxiv.org/abs/1201.2501v1 O(k log n log(n/k)) complexity for the general case.

Paper and discussion history. A mention is not an endorsement.

Nearly Optimal Sparse Fourier Transform — mentioned by bgilroy26

Mon, 19 Mar 2012 23:00:11 GMT

Further Reading: Write up in MIT News discussing Dina Katabi and Piotr Indyk's work : http://web.mit.edu/newsoffice/2012/faster-fourier-transforms... The write up also links the pair's arXiv paper : http://arxiv.org/abs/1201.2501v1

Paper and discussion history. A mention is not an endorsement.

Nearly Optimal Sparse Fourier Transform — mentioned by tlb

Wed, 18 Jan 2012 16:57:16 GMT

Paper: http://arxiv.org/pdf/1201.2501v1 It starts by dividing the spectrum into frequency bins, and assumes that there is usually 0 or 1 non-zero coefficients in each bin. It wasn't clear to me what happens when a large number of non-zero coefficients are clustered together in one bin. Can O(k log n) still be achieved when most frequencies are clustered?

Paper and discussion history. A mention is not an endorsement.