Pages that link to "Item:Q2986494"
From MaRDI portal
The following pages link to Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions (Q2986494):
Displaying 11 items.
- A multiscale sub-linear time Fourier algorithm for noisy data (Q262947) (← links)
- A deterministic sparse FFT algorithm for vectors with small support (Q281476) (← links)
- Deterministic sparse FFT for \(M\)-sparse vectors (Q1751061) (← links)
- Explicit small sets with \(\varepsilon\)-discrepancy on Bohr sets (Q2015154) (← links)
- Deterministic sparse sublinear FFT with improved numerical stability (Q2038594) (← links)
- Coset decision trees and the Fourier algebra (Q2073019) (← links)
- Sparse fast DCT for vectors with one-block support (Q2274167) (← links)
- Real sparse fast DCT for vectors with short support (Q2332391) (← links)
- A sparse fast Fourier algorithm for real non-negative vectors (Q2357452) (← links)
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
- Nonlinear approximation in bounded orthonormal product bases (Q6049829) (← links)
