We consider the randomized communication complexity of the distributed
ℓ...
We consider sketching algorithms which first compress data by multiplica...
In the ℓ_p-subspace sketch problem, we are given an n× d matrix
A with n...
We initiate a broad study of classical problems in the streaming model w...
A treap is a classic randomized binary search tree data structure that i...
We propose data-driven one-pass streaming algorithms for estimating the
...
We study the problem of learning Bayesian networks where an
ϵ-fraction o...
Sketching is a dimensionality reduction technique where one compresses a...