6 citations · 25 across the 31 of their papers we have counts for
6 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.…
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…
Competitively Pricing Parking in a Tree
Max Bender, Jacob Gilbert, Aditya Krishnan +1
Motivated by demand-responsive parking pricing systems we consider posted-price algorithms for the online metrical matching problem and the online metrical searching problem in a t…
A Relational Gradient Descent Algorithm For Support Vector Machine Training
Mahmoud Abo-Khamis, Sungjin Im, Benjamin Moseley +2
We consider gradient descent like algorithms for Support Vector Machine (SVM) training when the data is in relational form. The gradient of the SVM objective can not be efficiently…
Approximate Aggregate Queries Under Additive Inequalities
Mahmoud Abo-Khamis, Sungjin Im, Benjamin Moseley +2
We consider the problem of evaluating certain types of functional aggregation queries on relational data subject to additive inequalities. Such aggregation queries, with a smallish…
Dynamic Weighted Fairness with Minimal Disruptions
Sungjin Im, Benjamin Moseley, Kamesh Munagala +1
In this paper, we consider the following dynamic fair allocation problem: Given a sequence of job arrivals and departures, the goal is to maintain an approximately fair allocation…