Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox

Picture for Alessandro Epasto

Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions


Oct 22, 2020
Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni, Manolis Zampetakis

* Accepted for spotlight presentation at NeurIPS 2020 

  Access Paper or Ask Questions

Fair Hierarchical Clustering


Jun 19, 2020
Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang


  Access Paper or Ask Questions

Fair Correlation Clustering


Mar 02, 2020
Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian


  Access Paper or Ask Questions

Clustering without Over-Representation


May 29, 2019
Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian

* in Proceedings of The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2019 
* 10 pages, 6 figures, in KDD 2019 

  Access Paper or Ask Questions

Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts


May 06, 2019
Alessandro Epasto, Bryan Perozzi

* In Proceedings of "The Web Conference" 2019, WWW, 2019 

  Access Paper or Ask Questions

On a Model for Integrated Information


Dec 31, 2009
Alessandro Epasto, Enrico Nardelli


  Access Paper or Ask Questions