Given a stream with frequencies fd, for d ∈ [n], we characterize the space necessary for approximating the frequency negative moments Fp = ∑ |fd|, where p < 0 and the sum is taken over all items d ∈… (More)

Given a stream <i>p</i><sub>1</sub>, …, <i>p</i><sub><i>m</i></sub> of items from a universe <i>U</i>, which, without loss of generality we identify with the set of integers {1, 2, …, <i>n</i>}, we… (More)

We characterize the streaming space complexity of every symmetric normÂ <i>l</i> (a norm on â<sup><i>n</i></sup> invariant under sign-flips and coordinate-permutations), by relating this space… (More)

A central problem in the theory of algorithms for data streams is to determine which functions on a stream can be approximated in sublinear, and especially sub-polynomial or poly-logarithmic, space.… (More)

We design new sketching algorithms for unitarily invariant matrix norms, including the Schatten p-norms ‖·‖Sp , and obtain, as a by-product, streaming algorithms that approximate the norm of a matrix… (More)