Foundations

Learning How to Ground a Plan – Partial Grounding in Classical Planning AAAI 2019 Learning Swarm Behaviors using Grammatical Evolution and Behavior Trees IJCAI 2019 Learning to Sample Hard Instances for Graph Algorithms ACML 2019 Lifting Vectorial Variational Problems: A Natural Formulation Based on Geometric Measure Theory and Discrete Exterior Calculus CVPR 2019 Machine Learning Based Heuristic Search Algorithms to Solve Birds of a Feather Card Game AAAI 2019 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 Novel positional encodings to enable tree-based transformers NeurIPS 2019 On Communication Complexity of Classification Problems COLT 2019 On Geometric Alignment in Low Doubling Dimension AAAI 2019 On Limited Conjunctions and Partial Features in Parameter-Tractable Feature Logics AAAI 2019 Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms NeurIPS 2019 Online Multi-Agent Pathfinding AAAI 2019 Online Prediction of Switching Graph Labelings with Cluster Specialists NeurIPS 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