Theory of discrete and continuous Fourier analysis
Theory of discrete and continuous Fourier analysis
Uncertainty principles and signal recovery
SIAM Journal on Applied Mathematics
Learning decision trees using the Fourier spectrum
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
&egr;-discrepancy sets and their application for interpolation of sparse polynomials
Information Processing Letters
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Reconstructing Algebraic Functions from Mixed Data
SIAM Journal on Computing
Fast computation of low rank matrix approximations
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Fast, small-space algorithms for approximate histogram maintenance
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved Sparse Multivariate Polynomial Interpolation Algorithms
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Fast Monte-Carlo Algorithms for finding low-rank approximations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Pass efficient algorithms for approximating large matrices
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation of functions over redundant dictionaries using coherence
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Clustering Data Streams: Theory and Practice
IEEE Transactions on Knowledge and Data Engineering
One-Pass Wavelet Decompositions of Data Streams
IEEE Transactions on Knowledge and Data Engineering
BRAID: stream mining through group lag correlations
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Extensions of compressed sensing
Signal Processing - Sparse approximations in signal and image processing
Journal of Computational Physics
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Explicit constructions for compressed sensing of sparse signals
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Decodability of group homomorphisms beyond the johnson bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Agnostically learning decision trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Private multiparty sampling and approximation of vector combinations
Theoretical Computer Science
Periodicity testing with sublinear samples and space
ACM Transactions on Algorithms (TALG)
Beyond Nyquist: efficient sampling of sparse bandlimited signals
IEEE Transactions on Information Theory
CoSaMP: iterative signal recovery from incomplete and inaccurate samples
Communications of the ACM
Fast Discovery of Group Lag Correlations in Streams
ACM Transactions on Knowledge Discovery from Data (TKDD)
Matrix sparsification and the sparse null space problem
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Periodicity and cyclic shifts via linear sketches
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
SIAM Journal on Scientific Computing
Simple and practical algorithm for sparse Fourier transform
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Combinatorial algorithms for compressed sensing
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Resource adaptive periodicity estimation of streaming data
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Nearly optimal sparse fourier transform
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Cooperative spectrum sensing in cognitive radio networks: A survey
Physical Communication
Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform
Proceedings of the 32nd symposium on Principles of database systems
Pattern discovery in data streams under the time warping distance
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.08 |
(MATH) We give an algorithm for finding a Fourier representation R of B terms for a given discrete signal signal A of length N, such that $\|\signal-\repn\|_2^2$ is within the factor (1 +&egr;) of best possible $\|\signal-\repn_\opt\|_2^2$. Our algorithm can access A by reading its values on a sample set T ⊆[0,N), chosen randomly from a (non-product) distribution of our choice, independent of A. That is, we sample non-adaptively. The total time cost of the algorithm is polynomial in B log(N)log(M)&egr; (where M is the ratio of largest to smallest numerical quantity encountered), which implies a similar bound for the number of samples.