6 citations · 9 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Tight Bounds for the Subspace Sketch Problem with Applications
Yi Li, Ruosong Wang, David P. Woodruff
In the subspace sketch problem one is given an matrix with bit entries, and would like to compress it in an arbitrary way to build a small space data…
cs.DS2019
Deterministic Sparse Fourier Transform with an ell_infty Guarantee
Yi Li, Vasileios Nakos
In this paper we revisit the deterministic version of the Sparse Fourier Transform problem, which asks to read only a few entries of and design a recovery algo…