Pages that link to "Item:Q2477145"

The following pages link to Empirical evaluation of a sub-linear time sparse DFT algorithm (Q2477145):

Displayed 11 items.

• A multiscale sub-linear time Fourier algorithm for noisy data (Q262947) ‎ (← links)
• Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) ‎ (← links)
• Combinatorial sublinear-time Fourier algorithms (Q972615) ‎ (← links)
• 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)
• Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) ‎ (← links)
• A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) ‎ (← links)
• (Q5743468) ‎ (← links)
• Performance of the multiscale sparse fast Fourier transform algorithm (Q6045575) ‎ (← links)
• Nonlinear approximation in bounded orthonormal product bases (Q6049829) ‎ (← links)