Pages that link to "Item:Q972615"

The following pages link to Combinatorial sublinear-time Fourier algorithms (Q972615):

Displaying 37 items.

• A multiscale sub-linear time Fourier algorithm for noisy data (Q262947) (← links)
• A deterministic sparse FFT algorithm for vectors with small support (Q281476) (← links)
• Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763) (← links)
• Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
• Parameter estimation for nonincreasing exponential sums by Prony-like methods (Q389569) (← links)
• Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) (← links)
• What's the frequency, Kenneth?: sublinear Fourier sampling off the grid (Q747618) (← links)
• A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
• Deterministic sparse FFT for \(M\)-sparse vectors (Q1751061) (← links)
• Superfast Fourier transform using QTT approximation (Q1759431) (← links)
• Strengthening hash families and compressive sensing (Q1932362) (← 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)
• A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions (Q2118948) (← links)
• Spectral compressive sensing (Q2252132) (← 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)
• 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)
• Deterministic sampling of sparse trigonometric polynomials (Q2431334) (← links)
• Theory and applications of compressed sensing (Q2864809) (← links)
• Detecting the large entries of a sparse covariance matrix in sub-quadratic time (Q4603728) (← 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)
• Stochastic Collocation via<i>l</i>₁-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification (Q5372043) (← 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)