Conference Optimal Sketching for Kronecker Product Regression and Low Rank Approximation 2019 • Advances in Neural Information Processing Systems • 32: Diao H, Jayaram R, Song Z, Sun W, Woodruff DP
Conference Querying a matrix through matrix-vector products 2019 • Leibniz International Proceedings in Informatics • 132: Sun X, Woodruff DP, Yang G, Zhang J
Conference Regularized Weighted Low Rank Approximation 2019 • Advances in Neural Information Processing Systems • 32: Ban F, Woodruff D, Zhang QR
Conference Relative error tensor low rank approximation 2019 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 2772-2789 Song Z, Woodruff DP, Zhong P
Preprint Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation 2019 Bakshi A, Chepurko N, Woodruff DP
Journal Article Robust communication-optimal distributed clustering algorithms 2019 • Leibniz International Proceedings in Informatics • 132: Awasthi P, Bakshi A, Balcan MF, White C, Woodruff DP
Preprint Sample-Optimal Low-Rank Approximation of Distance Matrices 2019 Indyk P, Vakilian A, Wagner T, Woodruff D
Conference Sample-Optimal Low-Rank Approximation of Distance Matrices 2019 • Proceedings of Machine Learning Research • 99:1723-1751 Indyk P, Vakilian A, Wagner T, Woodruff DP
Conference Separating k-player from T-player one-way communication, with applications to data streams 2019 • Leibniz International Proceedings in Informatics • 132: Woodruff DP, Yang G
Preprint Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation 2019 Musco C, Musco C, Woodruff DP
Conference Sublinear Time Numerical Linear Algebra for Structured Matrices 2019 • Proceedings of the ... AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence • 4918-4925 Shi X, Woodruff DP
Conference Testing matrix rank, optimally 2019 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 727-746 Balcan MF, Li Y, Woodruff DP, Zhang H
Preprint The One-Way Communication Complexity of Dynamic Time Warping Distance 2019 Braverman V, Charikar M, Kuszmaul W, Woodruff DP, Yang LF
Conference The one-way communication complexity of dynamic time warping distance 2019 • Leibniz International Proceedings in Informatics • 129: Braverman V, Charikar M, Kuszmaul W, Woodruff DP, Yang LF
Conference The query complexity of mastermind with ℓ<inf>p</inf> distances 2019 • Leibniz International Proceedings in Informatics • 145: Fernández MV, Woodruff DP, Yasuda T
Conference Tight bounds for `<inf>p</inf> oblivious subspace embeddings 2019 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 1825-1843 Wang R, Woodruff DP
Conference Tight dimensionality reduction for sketching low degree polynomial kernels 2019 • Advances in Neural Information Processing Systems • 32: Meister M, Sarlos T, Woodruff DP
Conference Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel <i>k</i>-means Clustering 2019 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97 • 97: Fernandez M, Woodruff DP, Yasuda T
Conference Tight kernel query complexity of kernel ridge regression and kernel k-means clustering 2019 • 36th International Conference on Machine Learning, ICML 2019 • 2019-June:12209-12217 Fernández M, Woodruff DP, Yasuda T
Conference Total Least Squares Regression in Input Sparsity Time 2019 • Advances in Neural Information Processing Systems • 32: Diao H, Song Z, Woodruff DP, Yang X
Conference Towards a Zero-One Law for Column Subset Selection 2019 • Advances in Neural Information Processing Systems • 32: Song Z, Woodruff DP, Zhong P
Conference Towards optimal moment estimation in streaming and distributed models 2019 • Leibniz International Proceedings in Informatics • 145: Jayaram R, Woodruff DP
Preprint Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams 2019 Bakshi A, Chepurko N, Woodruff DP
Preprint Weighted Reservoir Sampling from Distributed Streams 2019 Jayaram R, Sharma G, Tirthapura S, Woodruff DP
