4 citations · 5 across the 2 of their papers we have counts for
3 papers
cs.DS2015
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…
cs.DS2015★ 1 cited
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…
cs.DS2014★ 4 cited
Approximating Large Frequency Moments with Bits
Vladimir Braverman, Jonathan Katzman, Charles Seidell +1
In this paper we consider the problem of approximating frequency moments in the streaming model. Given a stream of numbers from , a freq…