Pages that link to "Item:Q1762319"

The following pages link to Improved approximation guarantees for sublinear-time Fourier algorithms (Q1762319):

Displaying 26 items.

• A deterministic sparse FFT algorithm for vectors with small support (Q281476) (← links)
• Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763) (← links)
• Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) (← links)
• Deterministic sparse FFT for \(M\)-sparse vectors (Q1751061) (← links)
• A deterministic sparse FFT for functions with structured Fourier sparsity (Q2000485) (← links)
• High-dimensional sparse Fourier algorithms (Q2021766) (← 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)
• Deterministic sparse sublinear FFT with improved numerical stability (Q2038594) (← links)
• A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size (Q2070286) (← links)
• Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables (Q2073139) (← links)
• The uniform sparse FFT with application to PDEs with random coefficients (Q2098298) (← links)
• A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions (Q2118948) (← links)
• Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137) (← 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)
• System identification in dynamical sampling (Q2363515) (← links)
• A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
• High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
• A note on the high-dimensional sparse Fourier transform in the continuous setting* (Q5030166) (← links)
• Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps (Q5088658) (← links)
• (Q5743468) (← links)
• Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares (Q5857850) (← links)
• Performance of the multiscale sparse fast Fourier transform algorithm (Q6045575) (← links)
• Nonlinear approximation in bounded orthonormal product bases (Q6049829) (← links)