Fetching the paper…
Reading the bibliography…
In this paper we consider the following sparse recovery problem.
Fast Algorithms for the Multi-dimensional Jacobi Polynomial Transform
1901
Earlier work this paper cites.
Orthogonal Polynomials
1975
Earlier work this paper cites.
The circle polynomials of zernike and their application in optics
1977
Earlier work this paper cites.
An Introduction to the Approximation of Functions
1981
Earlier work this paper cites.
Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
1990
Earlier work this paper cites.
Bounds for the small real and purely imaginary zeros of bessel and related functions
1995
Earlier work this paper cites.
Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs
1997
Earlier work this paper cites.
Near-optimal sparse fourier representations via sampling
2002
Earlier work this paper cites.
On sparse reconstruction from fourier and gaussian measurements
2008
Earlier work this paper cites.
Parameter estimation for exponential sums by approximate prony method
2010
Cited alongside, same era.
Nearly optimal sparse fourier transform
2012
Cited alongside, same era.
Sparse legendre expansions via
2012
Cited alongside, same era.
A Mathematical Introduction to Compressive Sensing
2013
Cited alongside, same era.
A generalized prony method for reconstruction of sparse sums of eigenfunctions of linear operators
2013
Cited alongside, same era.
An Improved Estimate in the Restricted Isometry Problem
2014
Cited alongside, same era.
Recent Developments in the Sparse Fourier Transform
Reconstruction of sparse legendre and gegenbauer expansions
2016
Later among the works it cites.
Predicting non-small cell lung cancer prognosis by fully automated microscopic pathology image features
2016
Later among the works it cites.
Gaussian quadrature for kernel features
2017
Later among the works it cites.
Rapidly computing sparse legendre expansions via sparse fourier transforms
2017
Later among the works it cites.
Fast algorithms for Jacobi expansions via nonoscillatory phase functions
2018
Later among the works it cites.
Sparse Harmonic Transforms: A New Class of Sublinear-time Algorithms for Learning Functions of Many Variables
2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
Sample-optimal fourier sampling in any constant dimension
2014
Cited alongside, same era.
(nearly) sample-optimal sparse fourier transform
2014
Cited alongside, same era.
Orthogonal polynomials and gaussian quadrature
Cited in the paper.
Chebyshev polynomials in tcs and algorithm design
Cited in the paper.
Another proof for Jackson theorem
Cited in the paper.
Later among the works it cites.
Sparse Reconstruction from Hadamard Matrices: A Lower Bound
2019
Closest in time.
Dimension-independent sparse fourier transform
2019
Closest in time.
Improved Lower Bounds for the Restricted Isometry Property of Subsampled Fourier Matrices
2019
Closest in time.