Pages that link to "Item:Q2376358"
From MaRDI portal
The following pages link to Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358):
Displayed 13 items.
- 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)
- 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)
- Sparse fast DCT for vectors with one-block support (Q2274167) (← links)
- Real sparse fast DCT for vectors with short support (Q2332391) (← links)
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares (Q5857850) (← links)
- Nonlinear approximation in bounded orthonormal product bases (Q6049829) (← links)