#### Filter Results:

- Full text PDF available (97)

#### Publication Year

2002

2019

- This year (31)
- Last 5 years (111)
- Last 10 years (171)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

The statistical leverage scores of a matrix A are the squared row-norms of the matrix containing its (top) left singular vectors and the coherence is the largest leverage score. These quantities are… (More)

- David P. Woodruff
- Foundations and Trends in Theoretical Computer…
- 2014

This survey highlights the recent advances in algorithms for numerical linear algebra that have come from the technique of linear sketching, whereby given a matrix, one first compresses it to a much… (More)

- Kenneth L. Clarkson, David P. Woodruff
- STOC
- 2009

We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and approximation of matrix… (More)

- Piotr Indyk, David P. Woodruff
- FOCS 2003
- 2003

We give a 1-pass <i>Õ</i>(<i>m</i><sup>1-2⁄<i>k</i></sup>)-space algorithm for computing the <i>k</i>-th frequency moment of a data stream for any real <i>k</i> > 2. Together with the lower bounds of… (More)

- Daniel M. Kane, Jelani Nelson, David P. Woodruff
- PODS
- 2010

We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet and Martin in their… (More)

- Daniel M. Kane, Jelani Nelson, David P. Woodruff
- SODA
- 2010

We settle the 1-pass space complexity of (1 ± ε)-approximating the <i>L</i><sub><i>p</i></sub> norm, for real <i>p</i> with 1 ≤ <i>p</i> ≤ 2, of a length-<i>n</i> vector updated in a length-<i>m</i>… (More)

- Piotr Indyk, David P. Woodruff
- Electronic Colloquium on Computational Complexity
- 2005

In [12] a private approximation of a function f is defined to be another function F that approximates f in the usual sense, but does not reveal any information about x other than what can be deduced… (More)

- Christian Sohler, David P. Woodruff
- STOC
- 2011

We show there is a distribution over linear mappings R:l<sub>1</sub><sup>n</sup> -> l<sub>1</sub><sup>O(d log d)</sup>, such that with arbitrarily large constant probability, for any fixed… (More)

- Zhao Song, David P. Woodruff, Peilin Zhong
- STOC
- 2017

We study the â<sub>1</sub>-low rank approximation problem, where for a given <i>n</i> Ã <i>d</i> matrix <i>A</i> and approximation factor Î± â¥ 1, the goal is to output a rank-<i>k</i> matrix… (More)