3 citations · 5 across the 21 of their papers we have counts for
4 papers · 1 filter
The -Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
Yi Li, Honghao Lin, David P. Woodruff
In the -subspace sketch problem, we are given an matrix with , and asked to build a small memory data structure so that, for any query vector…
Streaming Algorithms with Large Approximation Factors
Yi Li, Honghao Lin, David P. Woodruff +1
We initiate a broad study of classical problems in the streaming model with insertions and deletions in the setting where we allow the approximation factor to be much larger th…
Learning Augmented Binary Search Trees
Honghao Lin, Tian Luo, David P. Woodruff
A treap is a classic randomized binary search tree data structure that is easy to implement and supports O(\log n) expected time access. However, classic treaps do not take advanta…
Triangle and Four Cycle Counting with Predictions in Graph Streams
Justin Y. Chen, Talya Eden, Piotr Indyk +7
We propose data-driven one-pass streaming algorithms for estimating the number of triangles and four cycles, two fundamental problems in graph analytics that are widely studied in…