
A Competitive Algorithm for Throughout Maximization on Identical Machines
This paper considers the basic problem of scheduling jobs online with pr...
read it

Faster Matchings via Learned Duals
A recent line of research investigates how algorithms can be augmented w...
read it

An Efficient Reduction of a Gammoid to a Partition Matroid
Our main contribution is a polynomialtime algorithm to reduce a kcolor...
read it

Using Predicted Weights for Ad Delivery
We study the performance of a proportional weights algorithm for online ...
read it

Instance Optimal Join Size Estimation
We consider the problem of efficiently estimating the size of the inner ...
read it

Learnable and InstanceRobust Predictions for Online Matching, Flows and Load Balancing
This paper proposes a new model for augmenting algorithms with useful pr...
read it

Structural Iterative Rounding for Generalized kMedian Problems
This paper considers approximation algorithms for generalized kmedian p...
read it

An Objective for Hierarchical Clustering in Euclidean Space and its Connection to Bisecting Kmeans
This paper explores hierarchical clustering in the case where pairs of p...
read it

Relational Algorithms for kmeans Clustering
The majority of learning tasks faced by data scientists involve relation...
read it

Fair Hierarchical Clustering
As machine learning has become more prevalent, researchers have begun to...
read it

Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP
We introduce multiple symmetric LP relaxations for minimum cut problems....
read it

Optimal Resource Allocation for Elastic and Inelastic Jobs
Modern data centers are tasked with processing heterogeneous workloads c...
read it

A Relational Gradient Descent Algorithm For Support Vector Machine Training
We consider gradient descent like algorithms for Support Vector Machine ...
read it

Approximate Aggregate Queries Under Additive Inequalities
We consider the problem of evaluating certain types of functional aggreg...
read it

Fast Noise Removal for kMeans Clustering
This paper considers kmeans clustering in the presence of noise. It is ...
read it

Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks
New optical technologies offer the ability to reconfigure network topolo...
read it

Dynamic Weighted Fairness with Minimal Disruptions
In this paper, we consider the following dynamic fair allocation problem...
read it

Scheduling to Approximate Minimization Objectives on Identical Machines
This paper considers scheduling on identical machines. The scheduling ob...
read it

A Conditional Lower Bound on Graph Connectivity in MapReduce
MapReduce (and its open source implementation Hadoop) has become the de ...
read it

Backprop with Approximate Activations for Memoryefficient Network Training
Larger and deeper neural network architectures deliver improved accuracy...
read it

On Functional Aggregate Queries with Additive Inequalities
Motivated by fundamental applications in databases and relational machin...
read it

Efficient nonmyopic active search with applications in drug and materials discovery
Active search is a learning paradigm for actively identifying as many me...
read it

PreSynaptic Pool Modification (PSPM): A Supervised Learning Procedure for Spiking Neural Networks
A central question in neuroscience is how to develop realistic models th...
read it

Online NonPreemptive Scheduling to Minimize Weighted Flowtime on Unrelated Machines
In this paper, we consider the online problem of scheduling independent ...
read it

Online Nonpreemptive Scheduling on Unrelated Machines with Rejections
When a computer system schedules jobs there is typically a significant c...
read it

Bargaining for Revenue Shares on Tree Trading Networks
We study trade networks with a tree structure, where a seller with a sin...
read it
Benjamin Moseley
is this you? claim profile