The following pages link to (Q5743468):
Displaying 28 items.
- A multiscale sub-linear time Fourier algorithm for noisy data (Q262947) (← links)
- Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763) (← links)
- Sparse generalized Fourier transforms (Q878201) (← links)
- Multithreaded implicitly dealiased convolutions (Q1701055) (← links)
- Sparse interpolation, the FFT algorithm and FIR filters (Q1701467) (← links)
- Fast Haar transforms for graph neural networks (Q1982431) (← 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)
- 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)
- Sparse fast DCT for vectors with one-block support (Q2274167) (← links)
- Vibration analysis of cyclic symmetrical systems by quantum algorithms (Q2298504) (← links)
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling (Q2349094) (← links)
- A sparse fast Fourier algorithm for real non-negative vectors (Q2357452) (← links)
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis (Q2572217) (← links)
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
- Sparse Fourier Transform via Butterfly Algorithm (Q3567001) (← links)
- Comments on "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms (Q4564476) (← links)
- On Performance of Sparse Fast Fourier Transform and Enhancement Algorithm (Q4621928) (← links)
- An adaptive sublinear-time block sparse fourier transform (Q4978017) (← 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)
- (Q5091186) (← links)
- (Q5371885) (← links)
- Performance of the multiscale sparse fast Fourier transform algorithm (Q6045575) (← links)
- Nonlinear approximation in bounded orthonormal product bases (Q6049829) (← links)
- Two subspace methods for frequency sparse graph signals (Q6652571) (← links)
