Co-occurring keywords · papers mentioning both
Papers
Revisiting DP-Means: fast scalable algorithms via parallelism and delayed cluster creation
UAI 2022
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
NeurIPS 2021
Efficient and Local Parallel Random Walks
NeurIPS 2021
Efficient Message Passing for 0–1 ILPs with Binary Decision Diagrams
ICML 2021
Parallel and Efficient Hierarchical k-Median Clustering
NeurIPS 2021
Fast and Parallel Decomposition of Constraint Satisfaction Problems
IJCAI 2020
Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games
NeurIPS 2020
Linear Dynamical Systems as a Core Computational Primitive
NeurIPS 2020
Lower Bounds for Parallel and Randomized Convex Optimization
JMLR 2020
On the Enumeration of Association Rules: A Decomposition-based Approach
IJCAI 2020
Parallel Algorithm for Non-Monotone DR-Submodular Maximization
ICML 2020
Real-Time Route Search by Locations
AAAI 2020
Scalable Belief Propagation via Relaxed Scheduling
NeurIPS 2020
The FAST Algorithm for Submodular Maximization
ICML 2020
A Communication Efficient Stochastic Multi-Block Alternating Direction Method of Multipliers
NeurIPS 2019
A Direct tilde{O}(1/epsilon) Iteration Parallel Algorithm for Optimal Transport
NeurIPS 2019
Fast Parallel Algorithms for Statistical Subset Selection Problems
NeurIPS 2019
Improved Parallel Algorithms for Density-Based Network Clustering
ICML 2019
Lower Bounds for Parallel and Randomized Convex Optimization
COLT 2019
SySCD: A System-Aware Parallel Coordinate Descent Algorithm
NeurIPS 2019
Approximation Guarantees for Adaptive Sampling
ICML 2018
Communication Efficient Parallel Algorithms for Optimization on Manifolds
NeurIPS 2018
Composing Finite State Transducers on GPUs
ACL 2018
Distributing Frank-Wolfe via Map-Reduce
IJCAI 2018
HyP-DESPOT: A Hybrid Parallel Algorithm for Online Planning under Uncertainty
RSS 2018