Pages that link to "Item:Q2572217"

The following pages link to Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis (Q2572217):

Displayed 7 items.

• Matrix sparsification and the sparse null space problem (Q329287) ‎ (← links)
• Effective band-limited extrapolation relying on Slepian series and \(\ell^1\) regularization (Q611457) ‎ (← links)
• Three novel edge detection methods for incomplete and noisy spectral data (Q734948) ‎ (← links)
• Random sampling of sparse trigonometric polynomials (Q861807) ‎ (← links)
• A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing (Q861809) ‎ (← links)
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit (Q1029548) ‎ (← links)
• Superfast Fourier transform using QTT approximation (Q1759431) ‎ (← links)