Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Approximate sparse recovery
Fast, small-space algorithms for approximate histogram maintenance
Proceedings of the 42nd ACM symposium on Theory of computing - STOC ’10
IEEE Transactions on Information Theory
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02
Martin J. Strauss
Yi Li
Yannis Kotidis
Sudipto Guha
S. Muthukrishnan
Piotr Indyk
Image melding
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Beating CountSketch for heavy hitters in insertion streams
Density-aware compressive crowdsensing