Pages that link to "Item:Q5415501"
From MaRDI portal
The following pages link to Nearly optimal sparse fourier transform (Q5415501):
Displayed 27 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)
- Reconstruction of sparse Legendre and Gegenbauer expansions (Q329024) (← 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)
- Time series joins, motifs, discords and shapelets: a unifying view that exploits the matrix profile (Q1741368) (← links)
- Deterministic sparse FFT for \(M\)-sparse vectors (Q1751061) (← links)
- Superfast Fourier transform using QTT approximation (Q1759431) (← links)
- The partial fast Fourier transform (Q1785504) (← links)
- A deterministic sparse FFT for functions with structured Fourier sparsity (Q2000485) (← links)
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony? (Q2000529) (← links)
- High-dimensional sparse Fourier algorithms (Q2021766) (← links)
- Quantum learning of concentrated Boolean functions (Q2101535) (← links)
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions (Q2118948) (← 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)
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
- Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066) (← links)
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time (Q4603728) (← links)
- Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps (Q5088658) (← links)
- (Q5091164) (← links)
- Applications of classical approximation theory to periodic basis function networks and computational harmonic analysis (Q5396581) (← links)
- Performance of the multiscale sparse fast Fourier transform algorithm (Q6045575) (← links)
- Nonlinear approximation in bounded orthonormal product bases (Q6049829) (← links)