Randomized Interpolation and Approximationof Sparse Polynomials
SIAM Journal on Computing
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Near-optimal sparse fourier representations via sampling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Fast, small-space algorithms for approximate histogram maintenance
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Dynamic multidimensional histograms
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Querying and mining data streams: you only get one look a tutorial
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries
Proceedings of the 27th International Conference on Very Large Data Bases
New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
ACM Transactions on Computer Systems (TOCS)
What's hot and what's not: tracking most frequent items dynamically
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
One sketch for all: fast algorithms for compressed sensing
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Uncertainty principles, extractors, and explicit embeddings of l2 into l1
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Deterministic constructions of compressed sensing matrices
Journal of Complexity
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
IEEE Transactions on Information Theory
Pseudorandomness
Almost Euclidean subspaces of ℓN1 via expander codes
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Sketching in adversarial environments
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Information Processing Letters
A note on compressed sensing and the complexity of matrix multiplication
Information Processing Letters
Message passing algorithms and improved LP decoding
Proceedings of the forty-first annual ACM symposium on Theory of computing
Efficient and robust compressed sensing using optimized expander graphs
IEEE Transactions on Information Theory
Bit precision analysis for compressed sensing
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Sequential sparse matching pursuit
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A locally encodable and decodable compressed data structure
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On parity check (0, 1)-matrix over Zp
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Sketching in Adversarial Environments
SIAM Journal on Computing
Compressed sensing construction of spectrum map for routing in cognitive radio networks
Wireless Communications & Mobile Computing
Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.06 |
Over the recent years, a new approach for obtaining a succinct approximate representation of n-dimensional vectors (or signals) has been discovered. For any signal x, the succinct representation of x is equal to Ax, where A is a carefully chosen R x n real matrix, R ≪ n. Often, A is chosen at random from some distribution over R x n matrices. The vector Ax is often refered to as the measurement vector or a sketch of x. Although the dimension of Ax is much shorter than of x, it contains plenty of useful information about x.