Near-optimal sparse fourier representations via sampling
Authors:
- P. IndykPIP. Indyk
Open Access
- 19 May 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 152-161
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Fast, small-space algorithms for approximate histogram maintenance2002
- Fast computation of low rank matrix approximations2001
- Reconstructing Algebraic Functions from Mixed DataSIAM Journal on Computing, 1998
- Divergence of Decreasing Rearranged Fourier SeriesAnnals of Mathematics, 1996
- ϵ-discrepancy sets and their application for interpolation of sparse polynomialsInformation Processing Letters, 1995
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993
- Constant depth circuits, Fourier transform, and learnabilityJournal of the ACM, 1993
- Learning decision trees using the Fourier spectrum1991
- Uncertainty Principles and Signal RecoverySIAM Journal on Applied Mathematics, 1989
- Source coding of the discrete Fourier transformIEEE Transactions on Information Theory, 1978