3 citations · 3 across the 4 of their papers we have counts for
4 papers
Distributed Algorithms for Euclidean Clustering
Vincent Cohen-Addad, Liudeng Wang, David P. Woodruff +1
We study the problem of constructing -coresets for Euclidean -clustering in the distributed setting, where data points are partitioned across sites.…
Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
Vincent Cohen-Addad, David P. Woodruff, Shenghao Xie +1
We study the problem of graph and hypergraph sparsification in insertion-only data streams. The input is a hypergraph with nodes, hyperedges, and rank , an…
Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
Vincent Cohen-Addad, Liudeng Wang, David P. Woodruff +1
We show that both clustering and subspace embeddings can be performed in the streaming model with the same asymptotic efficiency as in the central/offline setting. For -clu…
On Efficient Low Distortion Ultrametric Embedding
Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde
A classic problem in unsupervised learning and data analysis is to find simpler and easy-to-visualize representations of the data that preserve its essential properties. A widely-u…