Pages that link to "Item:Q2903122"
From MaRDI portal
The following pages link to On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions (Q2903122):
Displaying 8 items.
- A deterministic sparse FFT for functions with structured Fourier sparsity (Q2000485) (← links)
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables (Q2031058) (← links)
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time (Q2038427) (← links)
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137) (← links)
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
- Explicit universal sampling sets in finite vector spaces (Q2399652) (← links)
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
- Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms (Q6168341) (← links)