The following pages link to (Q3579463):
Displaying 7 items.
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- A note on compressed sensing and the complexity of matrix multiplication (Q987795) (← links)
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549) (← 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)
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions (Q2118948) (← links)
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
