28 citations · 325 across the 73 of their papers we have counts for
4 papers · 1 filter
Approximating Subadditive Hadamard Functions on Implicit Matrices
Vladimir Braverman, Alan Roytman, Gregory Vorsanger
An important challenge in the streaming model is to maintain small-space approximations of entrywise functions performed on a matrix that is generated by the outer product of two v…
Beating CountSketch for Heavy Hitters in Insertion Streams
Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin +1
Given a stream of items from a universe , which, without loss of generality we identify with the set of integers , we consider…
Weighted Sampling Without Replacement from Data Streams
Vladimir Braverman, Rafail Ostrovsky, Gregory Vorsanger
Weighted sampling without replacement has proved to be a very important tool in designing new algorithms. Efraimidis and Spirakis (IPL 2006) presented an algorithm for weighted sam…
A Unified Approach for Clustering Problems on Sliding Windows
Vladimir Braverman, Harry Lang, Keith Levin +1
We explore clustering problems in the streaming sliding window model in both general metric spaces and Euclidean space. We present the first polylogarithmic space -approximat…