Algorithms

Practical Data-Dependent Metric Compression with Provable Guarantees NeurIPS 2017 Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs EMNLP 2017 Reconstructing the house from the ad: Structured prediction on real estate classifieds EACL 2017 SAT-Based Approaches for the General High School Timetabling Problem IJCAI 2017 Search Strategies as Synchronous Processes (Extended Abstract) IJCAI 2017 Solving Integer Linear Programs with a Small Number of Global Variables and Constraints IJCAI 2017 Solving Stochastic Boolean Satisfiability under Random-Exist Quantification IJCAI 2017 Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method IJCAI 2017 Sparse Randomized Partition Trees for Nearest Neighbor Search AISTATS 2017 Spatially-Varying Blur Detection Based on Multiscale Fused and Sorted Transform Coefficients of Gradient Magnitudes CVPR 2017 Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NeurIPS 2017 Symbolic LTLf Synthesis IJCAI 2017 The DNA Word Design Problem: A New Constraint Model and New Results IJCAI 2017 The Geometry of First-Returning Photons for Non-Line-Of-Sight Imaging CVPR 2017 The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas IJCAI 2017 The Tractability of the Shapley Value over Bounded Treewidth Matching Games IJCAI 2017 Unsatisfiable Core Shrinking for Anytime Answer Set Optimization IJCAI 2017 An algorithm for L1 nearest neighbor search via monotonic embedding NeurIPS 2016 An Efficient Streaming Algorithm for the Submodular Cover Problem NeurIPS 2016 A Novel Relationship Between Dynamics and Complexity in Multi-agent Collision Avoidance RSS 2016 A subtree-based factorization of dependency parsing COLING 2016 Bi-Objective Online Matching and Submodular Allocations NeurIPS 2016 Communication-Optimal Distributed Clustering NeurIPS 2016 Computationally Efficient Nyström Approximation using Fast Transforms ICML 2016 Efficient Globally Optimal 2D-To-3D Deformable Shape Matching CVPR 2016