13 citations · 60 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.…
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…
Fast Noise Removal for -Means Clustering
Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley +2
This paper considers -means clustering in the presence of noise. It is known that -means clustering is highly sensitive to noise, and thus noise should be removed to obtain a…
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…
Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution
Sungjin Im, Maryam Shadloo
We give a 1.488-approximation for the classic scheduling problem of minimizing total weighted completion time on unrelated machines. This is a considerable improvement on the recen…