Fetching the paper…
Reading the bibliography…
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an n-dimensional signal.
The influence of variables on boolean functions
J. Kahn, G. Kalai, and N. Linial · 1988
Earlier work this paper cites.
A hard-corepredicate for allone-way functions
O. Goldreich and L. Levin · 1989
Earlier work this paper cites.
Elements of Information Theory
Thomas Cover and Joy Thomas · 1991
Earlier work this paper cites.
Learning decision trees using the Fourier spectrum
E. Kushilevitz and Y. Mansour · 1991
Earlier work this paper cites.
Randomized interpolation and approximation of sparse polynomials
Y. Mansour · 1992
Earlier work this paper cites.
Efficient similarity search in sequence databases
R. Agrawal, C. Faloutsos, and A. Swami · 1993
Earlier work this paper cites.
Constant depth circuits, Fourier transform, and learnability
N. Linial, Y. Mansour, and N. Nisan · 1993
Earlier work this paper cites.
Data driven signal processing: An approach for energy efficient computing
A. Chandrakasan, V. Gutnik, and T. Xanthopoulos · 1996
Earlier work this paper cites.
OFDM Wireless LANs: A Theoretical and Practical Guide
Juha Heiskala and John Terry, Ph.D · 2001
Earlier work this paper cites.
Near-optimal sparse Fourier representations via sampling
A. Gilbert, S. Guha, P. Indyk, M. Muthukrishnan, and M. Strauss · 2002
Cited alongside, same era.
Proving hard-core predicates using list decoding
A. Akavia, S. Goldwasser, and S. Safra · 2003
Cited alongside, same era.
Evaluating the normal distribution
G. Marsaglia · 2004
Cited alongside, same era.
Improved time bounds for near-optimal space Fourier representations
A. Gilbert, M. Muthukrishnan, and M. Strauss · 2005
Cited alongside, same era.
Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
E. Candes, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
Compressed sensing
D. Donoho · 2006
Cited alongside, same era.
Deterministic sparse Fourier approximation via fooling arithmetic progressions
A. Akavia · 2010
Later among the works it cites.
Approximate sparse recovery: optimizing time and measurements
Anna C. Gilbert, Yi Li, Ely Porat, and Martin J. Strauss · 2010
Later among the works it cites.
Combinatorial sublinear-time Fourier algorithms
M. A. Iwen · 2010
Later among the works it cites.
Fast approximate correlation for massive time-series data
A. Mueen, S. Nath, and J. Liu · 2010
Later among the works it cites.
On the power of adaptivity in sparse recovery
P. Indyk, E. Price, and D. P. Woodruff · 2011
Later among the works it cites.
A new flexible filter bank for low complexity spectrum sensing in cognitive radios
Mengda Lin, A. P. Vinod, and Chong Meng Samson See · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A sparse spectral method for homogenization multiscale problems
I. Daubechies, O. Runborg, and J. Zou · 2007
Cited alongside, same era.
A tutorial on fast Fourier sampling
A.C. Gilbert, M.J. Strauss, and J. A. Tropp · 2008
Cited alongside, same era.
Some topics in analysis of boolean functions (tutorial)
R. O’Donnell · 2008
Cited alongside, same era.
( 1 + ϵ ) (1+\epsilon) -approximate sparse recovery
E. Price and D. P. Woodruff · 2011
Later among the works it cites.
sFFT: Sparse Fast Fourier Transform
H. Hassanieh, P. Indyk, D. Katabi, and E. Price · 2012
Closest in time.
Simple and practical algorithm for sparse Fourier transform
H. Hassanieh, P. Indyk, D. Katabi, and E. Price · 2012
Closest in time.