32 citations · 140 across the 32 of their papers we have counts for
3 papers · 1 filter
ASYMP: Fault-tolerant Mining of Massive Graphs
Eduardo Fleury, Silvio Lattanzi, Vahab Mirrokni +1
We present ASYMP, a distributed graph processing system developed for the timely analysis of graphs with trillions of edges. ASYMP has several distinguishing features including a r…
One-Shot Coresets: The Case of k-Clustering
Olivier Bachem, Mario Lucic, Silvio Lattanzi
Scaling clustering algorithms to massive data sets is a challenging task. Recently, several successful approaches based on data summarization methods, such as coresets and sketches…
Algorithms for Low Rank Approximation
Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar +3
We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise -approximation error, for any ; the case is t…