Foundations

Automatic differentiation in ML: Where we are and where we should be going NeurIPS 2018 Best-Case and Worst-Case Behavior of Greedy Best-First Search IJCAI 2018 Beyond Grobner Bases: Basis Selection for Minimal Solvers CVPR 2018 Bipartite Stochastic Block Models with Tiny Clusters NeurIPS 2018 Clausal Modifiers in the Grammar Matrix COLING 2018 Clustering Uncertain Graphs with Node Attributes ACML 2018 Coded Sparse Matrix Multiplication ICML 2018 Complexity of Scheduling Charging in the Smart Grid IJCAI 2018 Composing Finite State Transducers on GPUs ACL 2018 Computational Challenges for Polysynthetic Languages COLING 2018 Computational Social Choice Meets Databases IJCAI 2018 Computing Higher Order Derivatives of Matrix and Tensor Expressions NeurIPS 2018 Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs NeurIPS 2018 Computing the Schulze Method for Large-Scale Preference Data Sets IJCAI 2018 Constraining MGbank: Agreement, L-Selection and Supertagging in Minimalist Grammars ACL 2018 Content-Sensitive Supervoxels via Uniform Tessellations on Video Manifolds CVPR 2018 Coordinate Descent with Bandit Sampling NeurIPS 2018 Cost-Based Goal Recognition for the Path-Planning Domain IJCAI 2018 Divide and Conquer: Towards Faster Pseudo-Boolean Solving IJCAI 2018 Dynamic Fair Division Problem with General Valuations IJCAI 2018 Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams AISTATS 2018 Efficient Large-Scale Approximate Nearest Neighbor Search on OpenCL FPGA CVPR 2018 Efficient Loss-Based Decoding on Graphs for Extreme Classification NeurIPS 2018 Efficient Pruning of Large Knowledge Graphs IJCAI 2018 Exact Algorithms and Complexity of Kidney Exchange IJCAI 2018