Fetching the paper…
Reading the bibliography…
The ability to resolve detail in the object that is being imaged, named by resolution, is the core parameter of an imaging system.
On a modification of chebyshev’s inequality and of the error formula of laplace
Sergei Bernstein · 1924
Earlier work this paper cites.
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
Herman Chernoff · 1952
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1963
Earlier work this paper cites.
Continuous analogues of series
RP Boas Jr and H Pollard · 1973
Earlier work this paper cites.
The retrieval of harmonics from a covariance function
Vladilen F Pisarenko · 1973
Earlier work this paper cites.
Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
Yingbo Hua and Tapan K Sarkar · 1990
Earlier work this paper cites.
List of references on spectral line analysis
Petre Stoica · 1993
Earlier work this paper cites.
Computational geometry algorithms and applications
Marc Van Kreveld, Otfried Schwarzkopf, Mark de Berg, and Mark Overmars · 2000
Earlier work this paper cites.
Improved time bounds for near-optimal sparse Fourier representations
Anna C Gilbert, S Muthukrishnan, and Martin Strauss · 2005
Earlier work this paper cites.
Near-optimal signal recovery from random projections: Universal encoding strategies?
Emmanuel J Candes and Terence Tao · 2006
Earlier work this paper cites.
Compressed sensing
David L. Donoho · 2006
Earlier work this paper cites.
Iterative thresholding for sparse approximations
Thomas Blumensath and Mike E Davies · 2008
Earlier work this paper cites.
On sparse reconstruction from Fourier and Gaussian measurements
Mark Rudelson and Roman Vershynin · 2008
Earlier work this paper cites.
Introduction to algorithms
Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein · 2009
Earlier work this paper cites.
Faster integer multiplication
Martin Fürer · 2009
Earlier work this paper cites.
Lower bounds for sparse recovery
Khanh Do Ba, Piotr Indyk, Eric Price, and David P Woodruff · 2010
Earlier work this paper cites.
Approximate sparse recovery: optimizing time and measurements
Anna C Gilbert, Yi Li, Ely Porat, and Martin J Strauss · 2010
Earlier work this paper cites.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2010
Earlier work this paper cites.
K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance
Piotr Indyk and Eric Price · 2011
Earlier work this paper cites.
On the power of adaptivity in sparse recovery
Piotr Indyk, Eric Price, and David P Woodruff · 2011
Earlier work this paper cites.
Efficient sketches for the set query problem
Eric Price · 2011
Earlier work this paper cites.
What’s the frequency, Kenneth?: Sublinear Fourier sampling off the grid
Petros Boufounos, Volkan Cevher, Anna C Gilbert, Yi Li, and Martin J Strauss · 2012
Earlier work this paper cites.
Nearly optimal sparse Fourier transform
Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price · 2012
Earlier work this paper cites.
Simple and practical algorithm for sparse Fourier transform
Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price · 2012
Cited alongside, same era.
Spectral compressed sensing via structured matrix completion
Yuxin Chen and Yuejie Chi · 2013
Cited alongside, same era.
Super-resolution from noisy data
Emmanuel J Candès and Carlos Fernandez-Granda · 2013
Cited alongside, same era.
Distributions of angles in random packing on spheres
Tony Cai, Jianqing Fan, and Tiefeng Jiang · 2013
Cited alongside, same era.
Restricted isometry of Fourier matrices and list decodability of random linear codes
Mahdi Cheraghchi, Venkatesan Guruswami, and Ameya Velingker · 2013
Cited alongside, same era.
On model-based rip-1 matrices
Piotr Indyk and Ilya Razenshteyn · 2013
Cited alongside, same era.
Michael Kapralov · 2016
Later among the works it cites.
A multivariate generalization of prony’s method
Stefan Kunis, Thomas Peter, Tim Römer, and Ulrich von der Ohe · 2016
Later among the works it cites.
Heavy hitters via cluster-preserving clustering
Kasper Green Larsen, Jelani Nelson, Huy L Nguyên, and Mikkel Thorup · 2016
Later among the works it cites.
An adaptive sublinear-time block sparse Fourier transform
Volkan Cevher, Michael Kapralov, Jonathan Scarlett, and Amir Zandieh · 2017
Later among the works it cites.
Sample efficient estimation and recovery in sparse FFT via isolation on average
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Faster ridge regression via the subsampled randomized hadamard transform
Yichao Lu, Paramveer Dhillon, Dean P Foster, and Lyle Ungar · 2013
Cited alongside, same era.
Sparse recovery and Fourier sampling
Eric C Price · 2013
Cited alongside, same era.
Lower bounds for adaptive sparse recovery
Eric Price and David P. Woodruff · 2013
Cited alongside, same era.
An improved estimate in the restricted isometry problem
Jean Bourgain · 2014
Cited alongside, same era.
Towards a mathematical theory of super-resolution
Emmanuel J Candès and Carlos Fernandez-Granda · 2014
Cited alongside, same era.
Towards a mathematical theory of super-resolution
Emmanuel J Candès and Carlos Fernandez-Granda · 2014
Cited alongside, same era.
Michael Kapralov · 2017
Later among the works it cites.
High-dimensional probability: An introduction with applications in data science
Roman Vershynin · 2018
Later among the works it cites.
An improved lower bound for sparse reconstruction from subsampled hadamard matrices
Jaroslaw Blasiok, Patrick Lopatto, Kyle Luh, Jake Marcinek, and Shravas Rao · 2019
Later among the works it cites.
Active regression via linear-sample sparsification
Xue Chen and Eric Price · 2019
Later among the works it cites.
Estimating the frequency of a clustered signal
Xue Chen and Eric Price · 2019
Later among the works it cites.
Adaptive sparse recovery with limited adaptivity
Akshay Kamath and Eric Price · 2019
Later among the works it cites.
Dimension-independent sparse Fourier transform
Michael Kapralov, Ameya Velingker, and Amir Zandieh · 2019
Later among the works it cites.
Solving empirical risk minimization in the current matrix multiplication time
Yin Tat Lee, Zhao Song, and Qiuyi Zhang · 2019
Later among the works it cites.
A new class of fully discrete sparse fourier transforms: Faster stable implementations with guarantees
Sami Merhi, Ruochuan Zhang, Mark A Iwen, and Andrew Christlieb · 2019
Later among the works it cites.
Stronger L2/L2 compressed sensing; without iterating
Vasileios Nakos and Zhao Song · 2019
Later among the works it cites.
(Nearly) Sample-optimal sparse Fourier transform in any dimension; RIPless and Filterless
Vasileios Nakos, Zhao Song, and Zhengyu Wang · 2019
Later among the works it cites.
Matrix Theory: Optimization, Concentration and Algorithms
Zhao Song · 2019
Later among the works it cites.
Solving tall dense linear programs in nearly linear time
Jan van den Brand, Yin Tat Lee, Aaron Sidford, and Zhao Song · 2020
Closest in time.
Learning mixtures of linear regressions in subexponential time via Fourier moments
Sitan Chen, Jerry Li, and Zhao Song · 2020
Closest in time.
Deterministic sparse Fourier transform with an ℓ ∞ \ell_{\infty} guarantee
Yi Li and Vasileios Nakos · 2020
Closest in time.
Sparse fourier transform by traversing cooley-tukey fft computation graphs
Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, and Amir Zandieh · 2021
Closest in time.
Algorithmic foundations for the diffraction limit
Sitan Chen and Ankur Moitra · 2021
Closest in time.
Faster dynamic matrix inverse for faster lps
Shunhua Jiang, Zhao Song, Omri Weinstein, and Hengjie Zhang · 2021
Closest in time.
Sparse fourier transform over lattices: A unified approach to signal reconstruction
Zhao Song, Baocheng Sun, Omri Weinstein, and Ruizhe Zhang · 2022
Closest in time.