2.2k citations
- IBM (United States)US73 papers
- Stanford UniversityUS62 papers
- IBM Research - Thomas J. Watson Research CenterUS42 papers
- University of California, BerkeleyUS22 papers
- IBM Research - ZurichCH21 papers
- California Institute of TechnologyUS20 papers
- École Polytechnique Fédérale de LausanneCH15 papers
- Massachusetts Institute of TechnologyUS14 papers
- Max Planck Institute of Microstructure PhysicsDE13 papers
- ETH ZurichCH10 papers
- Princeton UniversityUS10 papers
- SLAC National Accelerator LaboratoryUS10 papers
5 papers · 2 filters
How to Fake Multiply by a Gaussian Matrix
Michael Kapralov, Vamsi K. Potluru, David P. Woodruff
Have you ever wanted to multiply an matrix , with , on the left by an matrix of i.i.d. Gaussian random variables, but could not aff…
On Approximating Functions of the Singular Values in a Stream
Yi Li, David P. Woodruff
For any real number , we nearly completely characterize the space complexity of estimating for matrices in which each row a…
New Algorithms for Heavy Hitters in Data Streams
David P. Woodruff
An old and fundamental problem in databases and data streams is that of finding the heavy hitters, also known as the top-, most popular items, frequent items, elephants, or iceb…
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems
Arnab Bhattacharyya, Palash Dey, David P. Woodruff
We give the first optimal bounds for returning the -heavy hitters in a data stream of insertions, together with their approximate frequencies, closing a long line of work o…
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors
Vladimir Braverman, Stephen R. Chestnut, David P. Woodruff +1
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-l…