10 citations · 10 across the 1 of their papers we have counts for
2 papers
cs.DS2020★ 10 cited
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
Janardhan Kulkarni, Shi Li, Jakub Tarnawski +1
We consider the classic problem of scheduling jobs with precedence constraints on a set of identical machines to minimize the makespan objective function. Understanding the exact a…
cs.LG2018
Differentially Private Empirical Risk Minimization Revisited: Faster and More General
Di Wang, Minwei Ye, Jinhui Xu
In this paper we study the differentially private Empirical Risk Minimization (ERM) problem in different settings. For smooth (strongly) convex loss function with or without (non)-…