Recursive Sketches for Modular Deep Learning. | 0 | 0.34 | 2019 |
Efficient Rematerialization for Deep Networks | 0 | 0.34 | 2019 |
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. | 1 | 0.35 | 2018 |
On the Computational Power of Online Gradient Descent. | 0 | 0.34 | 2018 |
Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation). | 8 | 0.46 | 2018 |
An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization. | 1 | 0.44 | 2018 |
Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search. | 3 | 0.40 | 2017 |
The Complexity of the k-means Method. | 3 | 0.40 | 2016 |
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs. | 21 | 0.74 | 2016 |
Minimizing Regret with Multiple Reserves. | 11 | 0.58 | 2016 |
Finding four-node subgraphs in triangle time | 13 | 0.63 | 2015 |
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter | 7 | 0.46 | 2015 |
Space-Efficient Randomized Algorithms for K-SUM. | 1 | 0.35 | 2014 |