◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

David P. Woodruff

5 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author2
  • last author2

Across the 5 of 5 papers where every author was matched, so the position is known.

fields
  • cs.DS4
  • cs.LG1
ORCID 0000-0002-2158-1380
same name
  • David P. Woodruff — 176 papers, h 58
  • David P. Woodruff — 17 papers, h 5
  • David P. Woodruff — 16 papers, h 3
  • David P. Woodruff — 8 papers, h 2
  • David P. Woodruff — 8 papers, h 3
  • David P. Woodruff — 8 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20132019
most citedSubspace Embeddings and ℓp​-Regression Using Exponential Random Variables

22 citations · 36 across the 5 of their papers we have counts for

collaborators
Showing cs.DSShow all

4 papers · 1 filter

cs.DS2019

Oblivious Sketching of High-Degree Polynomial Kernels

Thomas D. Ahle, Michael Kapralov, Jakob B. T. Knudsen +4

Kernel methods are fundamental tools in machine learning that allow detection of non-linear dependencies between data without explicitly constructing feature vectors in high dimens…

cs.DS2016★ 2 cited

Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order

Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer +3

A central problem in data streams is to characterize which functions of an underlying frequency vector can be approximated efficiently. Recently there has been considerable effort…

cs.DS2015★ 12 cited

Frequent Directions : Simple and Deterministic Matrix Sketching

Mina Ghashami, Edo Liberty, Jeff M. Phillips +1

We describe a new algorithm called Frequent Directions for deterministic matrix sketching in the row-updates model. The algorithm is presented an arbitrary input matrix $A \in R^{n…

cs.DS2013★ 22 cited

Subspace Embeddings and ℓp​-Regression Using Exponential Random Variables

David P. Woodruff, Qin Zhang

Oblivious low-distortion subspace embeddings are a crucial building block for numerical linear algebra problems. We show for any real p,1≤p<∞, given a matrix $M \in…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.