Algorithms

A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems AAAI 2020 Almost No News on the Complexity of MAP in Bayesian Networks PGM 2020 A mathematical model for automatic differentiation in machine learning NeurIPS 2020 A MaxSAT-Based Framework for Group Testing AAAI 2020 An Õ(m/ε^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints COLT 2020 An Algorithm for Multi-Attribute Diverse Matching IJCAI 2020 Approximating bounded tree-width Bayesian network classifiers with OBDD PGM 2020 Approximating shapes in images with low-complexity polygons CVPR 2020 A Randomized Algorithm to Reduce the Support of Discrete Measures NeurIPS 2020 A Simple and Efficient Tensor Calculus AAAI 2020 A Streaming Approach For Efficient Batched Beam Search EMNLP 2020 Augmenting the Power of (Partial) MaxSat Resolution with Extension AAAI 2020 A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search AAAI 2020 Balancing Gaussian vectors in high dimension COLT 2020 Batchy: Batch-scheduling Data Flow Graphs with Service-level Objectives NSDI 2020 Best-first Enumeration Based on Bounding Conflicts, and its Application to Large-scale Hybrid Estimation (Extended Abstract) IJCAI 2020 Better Algorithms for Estimating Non-Parametric Models in Crowd-Sourcing and Rank Aggregation COLT 2020 Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound IJCAI 2020 Bipartite Encoding: A New Binary Encoding for Solving Non-Binary CSPs IJCAI 2020 Black-Box Methods for Restoring Monotonicity ICML 2020 Bounds in query learning COLT 2020 Budgeted Facility Location Games with Strategic Facilities IJCAI 2020 Byzantine Ordered Consensus without Byzantine Oligarchy OSDI 2020 Can Facial Pose and Expression Be Separated With Weak Perspective Camera? CVPR 2020 Cobra: Making Transactional Key-Value Stores Verifiably Serializable OSDI 2020