activity
20162026
most citedIs a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts

109 citations · 266 across the 23 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches

Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni +1

Streaming computation plays an important role in large-scale data analysis. The sliding window model is a model of streaming computation which also captures the recency of the data…

cs.DS2021

Massively Parallel and Dynamic Algorithms for Minimum Size Clustering

Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni +1

In this paper, we study the -gather problem, a natural formulation of minimum-size clustering in metric spaces. The goal of -gather is to partition points into clusters s…