Fetching the paper…
Reading the bibliography…
We consider the extensively studied problem of $\ell_2/\ell_2$ compressed sensing.
Rules for ordering uncertain prospects
Josef Hadar and William R Russell · 1969
Earlier work this paper cites.
Optimal rules for ordering uncertain prospects
Vijay S Bawa · 1975
Earlier work this paper cites.
One-dimensional stable distributions
Vladimir M Zolotarev · 1986
Earlier work this paper cites.
Computing iceberg queries efficiently
Min Fang, Narayanan Shivakumar, Hector Garcia-Molina, Rajeev Motwani, and Jeffrey D Ullman · 1999
Earlier work this paper cites.
Finding frequent items in data streams
Moses Charikar, Kevin Chen, and Martin Farach-Colton · 2002
Earlier work this paper cites.
Near-optimal sparse Fourier representations via sampling
Anna C Gilbert, Sudipto Guha, Piotr Indyk, S Muthukrishnan, and Martin Strauss · 2002
Earlier work this paper cites.
New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
Cristian Estan and George Varghese · 2003
Earlier work this paper cites.
Sketch-based change detection: methods, evaluation, and applications
Balachander Krishnamurthy, Subhabrata Sen, Yin Zhang, and Yan Chen · 2003
Earlier work this paper cites.
Holistic UDAFs at streaming speeds
Graham Cormode, Theodore Johnson, Flip Korn, Shan Muthukrishnan, Oliver Spatscheck, and Divesh Srivastava · 2004
Earlier work this paper cites.
An improved data stream summary: the count-min sketch and its applications
Graham Cormode and Shan Muthukrishnan · 2004
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.
Data Streams: Algorithms and Applications
S. Muthukrishnan · 2005
Earlier work this paper cites.
Generating functionology
Herbert S Wilf · 2005
Earlier work this paper cites.
Fiber-optic localization by geometric space coding with a two-dimensional gray code
Yunhui Zheng, David J Brady, Michaell E Sullivan, and Bob D Guenther · 2005
Earlier work this paper cites.
Combinatorial algorithms for compressed sensing
Graham Cormode and S Muthukrishnan · 2006
Earlier work this paper cites.
Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
Emmanuel J Candès, Justin Romberg, and Terence Tao · 2006
Earlier work this paper cites.
Stable signal recovery from incomplete and inaccurate measurements
Emmanuel J Candès, Justin K Romberg, and Terence Tao · 2006
Earlier work this paper cites.
Prospects and current studies on background subtraction techniques for moving objects detection from surveillance video
Ke-xue Dai, Guo-hui Li, Dan Tu, and Jian Yuan · 2006
Earlier work this paper cites.
Compressed sensing
David L. Donoho · 2006
Earlier work this paper cites.
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Piotr Indyk · 2006
Earlier work this paper cites.
A new compressive imaging camera architecture using optical-domain compression
Dharmpal Takhar, Jason N Laska, Michael B Wakin, Marco F Duarte, Dror Baron, Shriram Sarvotham, Kevin F Kelly, and Richard G Baraniuk · 2006
Earlier work this paper cites.
Nonadaptive group testing based fiber sensor deployment for multiperson tracking
Yunhui Zheng, Nikos P Pitsianis, and David J Brady · 2006
Earlier work this paper cites.
k k -mismatch with don’t cares
Raphaël Clifford, Klim Efremenko, Ely Porat, and Amir Rothschild · 2007
Earlier work this paper cites.
Sketching, streaming and sublinear-space algorithms
Piotr Indyk · 2007
Earlier work this paper cites.
Sparse MRI: The application of compressed sensing for rapid MR imaging
Michael Lustig, David Donoho, and John M Pauly · 2007
Earlier work this paper cites.
Sparse recovery using sparse random matrices
Radu Berinde and Piotr Indyk · 2008
Earlier work this paper cites.
Practical near-optimal sparse recovery in the ℓ 1 \ell_{1} norm
Radu Berinde, Piotr Indyk, and Milan Ruzic · 2008
Earlier work this paper cites.
Single-pixel imaging via compressive sampling
Marco F Duarte, Mark A Davenport, Dharmpal Takhar, Jason N Laska, Ting Sun, Kevin F Kelly, and Richard G Baraniuk · 2008
Earlier work this paper cites.
Near-optimal sparse recovery in the ℓ 1 \ell_{1} norm
Piotr Indyk and Milan Ruzic · 2008
Earlier work this paper cites.
Compressed sensing MRI
Michael Lustig, David L Donoho, Juan M Santos, and John M Pauly · 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.
Iterative hard thresholding for compressed sensing
Thomas Blumensath and Mike E Davies · 2009
Earlier work this paper cites.
Compressed sensing and best k k -term approximation
Albert Cohen, Wolfgang Dahmen, and Ronald DeVore · 2009
Cited alongside, same era.
Finding the frequent items in streams of data
Graham Cormode and Marios Hadjieleftheriou · 2009
Cited alongside, same era.
Recovery of clustered sparse signals from compressive measurements
Volkan Cevher, Piotr Indyk, Chinmay Hegde, and Richard G Baraniuk · 2009
Cited alongside, same era.
DNA sudoku-harnessing high-throughput sequencing for multiplexed specimen analysis
Yaniv Erlich, Kenneth Chang, Assaf Gordon, Roy Ronen, Oron Navon, Michelle Rooks, and Gregory J Hannon · 2009
Cited alongside, same era.
Compressed sensing approach for high throughput carrier screen
Yaniv Erlich, Noam Shental, Amnon Amir, and Or Zuk · 2009
Cited alongside, same era.
Cosamp: Iterative signal recovery from incomplete and inaccurate samples
Deanna Needell and Joel A Tropp · 2009
Compressive sensing: From theory to applications, a survey
Saad Qaisar, Rana Muhammad Bilal, Wafa Iqbal, Muqaddas Naureen, and Sungyoung Lee · 2013
Later among the works it 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 · 2014
Later among the works it cites.
An improved estimate in the restricted isometry problem
Jean Bourgain · 2014
Later among the works it cites.
Super: Sparse signals with unknown phases efficiently recovered
Sheng Cai, Mayank Bakshi, Sidharth Jaggi, and Minghua Chen · 2014
Later among the works it cites.
Sample-optimal Fourier sampling in any constant dimension
Piotr Indyk and Michael Kapralov · 2014
Later among the works it cites.
(Nearly) Sample-optimal sparse Fourier transform
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Rare-allele detection using compressed se(que)nsing
Noam Shental, Amnon Amir, and Or Zuk · 2009
Cited alongside, same era.
Model-based compressive sensing
Richard G Baraniuk, Volkan Cevher, Marco F Duarte, and Chinmay Hegde · 2010
Cited alongside, same era.
On compressive sensing applied to radar
Joachim HG Ender · 2010
Cited alongside, same era.
Sparse recovery using sparse matrices
Anna Gilbert and Piotr Indyk · 2010
Cited alongside, same era.
Approximate sparse recovery: optimizing time and measurements
Anna C Gilbert, Yi Li, Ely Porat, and Martin J Strauss · 2010
Cited alongside, same era.
PoolMC: Smart pooling of mRNA samples in microarray experiments
Raghunandan M Kainkaryam, Angela Bruex, Anna C Gilbert, John Schiefelbein, and Peter J Woolf · 2010
Cited alongside, same era.
Piotr Indyk, Michael Kapralov, and Eric Price · 2014
Later among the works it cites.
Time lower bounds for nonadaptive turnstile streaming algorithms
Kasper Green Larsen, Jelani Nelson, and Huy L Nguyên · 2015
Later among the works it cites.
The threshold for super-resolution via extremal functions
Ankur Moitra · 2015
Later among the works it cites.
A robust sparse Fourier transform in the continuous setting
Eric Price and Zhao Song · 2015
Later among the works it cites.
Fast and robust compressive phase retrieval with sparse-graph codes
Dong Yin, Kangwook Lee, Ramtin Pedarsani, and Kannan Ramchandran · 2015
Later among the works it cites.
Restricted isometry property for general p-norms
Zeyuan Allen-Zhu, Rati Gelashvili, and Ilya Razenshteyn · 2016
Later among the works it cites.
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching
Arturs Backurs, Piotr Indyk, Ilya Razenshteyn, and David P Woodruff · 2016
Later among the works it cites.
Fourier-sparse interpolation without a frequency gap
Xue Chen, Daniel M Kane, Eric Price, and Zhao Song · 2016
Later among the works it cites.
The restricted isometry property of subsampled Fourier matrices
Ishay Haviv and Oded Regev · 2016
Later among the works it cites.
Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time
Michael Kapralov · 2016
Later among the works it cites.
One-bit compressive sensing with norm estimation
Karin Knudson, Rayan Saab, and Rachel Ward · 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.
Irls and slime mold: Equivalence and convergence
Damian Straszak and Nisheeth K Vishnoi · 2016
Later among the works it cites.
Exponential decay of reconstruction error from binary measurements of sparse signals
Richard G Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, and Mary Wootters · 2017
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.
For-all sparse recovery in near-optimal time
Anna C Gilbert, Yi Li, Ely Porat, and Martin J Strauss · 2017
Later among the works it cites.
Sample efficient estimation and recovery in sparse FFT via isolation on average
Michael Kapralov · 2017
Later among the works it cites.
Sublinear-time algorithms for compressive phase retrieval
Yi Li and Vasileios Nakos · 2017
Later among the works it cites.
Almost optimal phaseless compressed sensing with sublinear decoding time
Vasileios Nakos · 2017
Later among the works it cites.
On fast decoding of high-dimensional signals from one-bit measurements
Vasileios Nakos · 2017
Later among the works it cites.
One-bit expandersketch for one-bit compressed sensing
Vasileios Nakos · 2017
Later among the works it cites.
Phasecode: Fast and efficient compressive phase retrieval based on sparse-graph codes
Ramtin Pedarsani, Dong Yin, Kangwook Lee, and Kannan Ramchandran · 2017
Later among the works it cites.
On low-risk heavy hitters and sparse recovery schemes
Yi Li, Vasileios Nakos, and David P. Woodruff · 2018
Later among the works it cites.
Improved algorithms for adaptive compressed sensing
Vasileios Nakos, Xiaofei Shi, David P. Woodruff, and Hongyang Zhang · 2018
Later among the works it cites.
Solving linear programs in the current matrix multiplication time
Michael B Cohen, Yin Tat Lee, and Zhao Song · 2019
Closest in time.
Dimension-independent sparse Fourier transform
Michael Kapralov, Ameya Velingker, and Amir Zandieh · 2019
Closest in time.