Sample-optimal Fourier sampling in any constant dimension
P Indyk, M Kapralov - 2014 IEEE 55th Annual Symposium on …, 2014 - ieeexplore.ieee.org
We give an algorithm for ℓ 2/ℓ 2 sparse recovery from Fourier measurements using O (k log
N) samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …
N) samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …
[PDF][PDF] Sample-Optimal Fourier Sampling in Any Constant Dimension
P Indyk, M Kapralov - 2014 - Citeseer
We give an algorithm for l2/l2 sparse recovery from Fourier measurements using O (k log N)
samples, matching the lower bound of [DIPW10] for non-adaptive algorithms up to constant …
samples, matching the lower bound of [DIPW10] for non-adaptive algorithms up to constant …
[PDF][PDF] Sample-Optimal Fourier Sampling in Any Constant Dimension
P Indyk, M Kapralov - 2014 - theory.epfl.ch
We give an algorithm for l2/l2 sparse recovery from Fourier measurements using O (k log N)
samples, matching the lower bound of [DIPW10] for non-adaptive algorithms up to constant …
samples, matching the lower bound of [DIPW10] for non-adaptive algorithms up to constant …
Sample-Optimal Fourier Sampling in Any Constant Dimension
P Indyk, M Kapralov - 2014 IEEE 55th Annual Symposium on Foundations of … - infona.pl
We give an algorithm for l2/l2 sparse recovery from Fourier measurements using O (klog N)
samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …
samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …
Sample-Optimal Fourier Sampling in Any Constant Dimension
P Indyk, M Kapralov - 2014 IEEE 55th Annual Symposium on …, 2014 - computer.org
We give an algorithm for l2/l2 sparse recovery from Fourier measurements using O (klog N)
samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …
samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …
[PDF][PDF] Sample-Optimal Fourier Sampling in Any Constant Dimension
P Indyk, M Kapralov - 2014 - scholar.archive.org
We give an algorithm for l2/l2 sparse recovery from Fourier measurements using O (k log N)
samples, matching the lower bound of [DIPW10] for non-adaptive algorithms up to constant …
samples, matching the lower bound of [DIPW10] for non-adaptive algorithms up to constant …
Sample-Optimal Fourier Sampling in Any Constant Dimension--Part I
P Indyk, M Kapralov - arXiv preprint arXiv:1403.5804, 2014 - arxiv.org
We give an algorithm for $\ell_2/\ell_2 $ sparse recovery from Fourier measurements using
$ O (k\log N) $ samples, matching the lower bound of\cite {DIPW} for non-adaptive …
$ O (k\log N) $ samples, matching the lower bound of\cite {DIPW} for non-adaptive …
[PDF][PDF] Sample-Optimal Fourier Sampling in Any Constant Dimension
P Indyk, M Kapralov - 2014 - groups.csail.mit.edu
We give an algorithm for l2/l2 sparse recovery from Fourier measurements using O (k log N)
samples, matching the lower bound of [DIPW10] for non-adaptive algorithms up to constant …
samples, matching the lower bound of [DIPW10] for non-adaptive algorithms up to constant …
[PDF][PDF] Sample-Optimal Fourier Sampling in Any Constant Dimension
P Indyk, M Kapralov - 2014 - people.csail.mit.edu
We give an algorithm for l2/l2 sparse recovery from Fourier measurements using O (k log N)
samples, matching the lower bound of [DIPW10] for non-adaptive algorithms up to constant …
samples, matching the lower bound of [DIPW10] for non-adaptive algorithms up to constant …
Sample-Optimal Fourier Sampling in Any Constant Dimension
P Indyk, M Kapralov - Proceedings of the 2014 IEEE 55th Annual …, 2014 - dl.acm.org
We give an algorithm for l2/l2 sparse recovery from Fourier measurements using O (klog N)
samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …
samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …