23 citations · 129 across the 42 of their papers we have counts for
13 papers · 1 filter
Instance Optimal Join Size Estimation
Mahmoud Abo-Khamis, Sungjin Im, Benjamin Moseley +2
We consider the problem of efficiently estimating the size of the inner join of a collection of preprocessed relational tables from the perspective of instance optimality analysis.…
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing
Thomas Lavastida, Benjamin Moseley, R. Ravi +1
We propose a new model for augmenting algorithms with predictions by requiring that they are formally learnable and instance robust. Learnability ensures that predictions can be ef…
Structural Iterative Rounding for Generalized -Median Problems
Anupam Gupta, Benjamin Moseley, Rudy Zhou
This paper considers approximation algorithms for generalized -median problems. This class of problems can be informally described as -median with a constant number of extra…
An Objective for Hierarchical Clustering in Euclidean Space and its Connection to Bisecting K-means
Benjamin Moseley, Yuyan Wang
This paper explores hierarchical clustering in the case where pairs of points have dissimilarity scores (e.g. distances) as a part of the input. The recently introduced objective f…
Relational Algorithms for k-means Clustering
Benjamin Moseley, Kirk Pruhs, Alireza Samadian +1
This paper gives a k-means approximation algorithm that is efficient in the relational algorithms model. This is an algorithm that operates directly on a relational database withou…
Fair Hierarchical Clustering
Sara Ahmadian, Alessandro Epasto, Marina Knittel +6
As machine learning has become more prevalent, researchers have begun to recognize the necessity of ensuring machine learning systems are fair. Recently, there has been an interest…