scientific article; zbMATH DE number 7053345
From MaRDI portal
Publication:5743468
zbMath1458.94097MaRDI QIDQ5743468
Eric Price, Haitham Hassanieh, Dina Katabi, Piotr Indyk
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095209
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for discrete and fast Fourier transforms (65T50) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38)
Related Items (18)
Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ High-dimensional sparse FFT based on sampling along multiple rank-1 lattices ⋮ Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps ⋮ Performance of the multiscale sparse fast Fourier transform algorithm ⋮ Nonlinear approximation in bounded orthonormal product bases ⋮ Multithreaded implicitly dealiased convolutions ⋮ Fast Haar transforms for graph neural networks ⋮ High-dimensional sparse Fourier algorithms ⋮ Sparse fast DCT for vectors with one-block support ⋮ Unnamed Item ⋮ Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables ⋮ Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time ⋮ Vibration analysis of cyclic symmetrical systems by quantum algorithms ⋮ Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables ⋮ Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling ⋮ A note on the high-dimensional sparse Fourier transform in the continuous setting* ⋮ A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions ⋮ A multiscale sub-linear time Fourier algorithm for noisy data
Uses Software
Cites Work
- Unnamed Item
- Combinatorial sublinear-time Fourier algorithms
- Improved approximation guarantees for sublinear-time Fourier algorithms
- Empirical evaluation of a sub-linear time sparse DFT algorithm
- Constant depth circuits, Fourier transform, and learnability
- A Sparse Spectral Method for Homogenization Multiscale Problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-optimal sparse fourier representations via sampling
- Combinatorial Algorithms for Compressed Sensing
- Learning Decision Trees Using the Fourier Spectrum
- Randomized interpolation and approximation of sparse polynomials stPreliminary version
- Compressed sensing
This page was built for publication:
