Algorithms

MAGSAC: Marginalizing Sample Consensus CVPR 2019 Matching with Constraints IJCAI 2019 MaxpoolNMS: Getting Rid of NMS Bottlenecks in Two-Stage Object Detectors CVPR 2019 Möbius Transformation for Fast Inner Product Search on Graph NeurIPS 2019 Modular Materialisation of Datalog Programs AAAI 2019 Multi-Agent Path Finding for Large Agents AAAI 2019 Multi-Agent Path Finding on Ozobots IJCAI 2019 (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs NeurIPS 2019 Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices JMLR 2019 New Convex Relaxations for MRF Inference With Unknown Graphs ICCV 2019 On Communication Complexity of Classification Problems COLT 2019 On Geometric Alignment in Low Doubling Dimension AAAI 2019 Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms NeurIPS 2019 Online Multi-Agent Pathfinding AAAI 2019 On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons NeurIPS 2019 On Succinct Encodings for the Tournament Fixing Problem IJCAI 2019 On the Complexity of the Inverse Semivalue Problem for Weighted Voting Games AAAI 2019 On the Optimal Efficiency of Cost-Algebraic A* AAAI 2019 Optimal Analysis of Subset-Selection Based L_p Low-Rank Approximation NeurIPS 2019 Optimally Efficient Bidirectional Search IJCAI 2019 Optimal Sparse Decision Trees NeurIPS 2019 Optimal Sparsity-Sensitive Bounds for Distributed Mean Estimation NeurIPS 2019 Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length AAAI 2019 Path Planning with CPD Heuristics IJCAI 2019 PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review ALT 2019