← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Efficient Loss-Based Decoding on Graphs for Extreme Classification NIPS 2018
Winning a Tournament by Any Means Necessary IJCAI 2018
Composing Finite State Transducers on GPUs ACL 2018
Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving IJCAI 2018
Analyzing Tie-Breaking Strategies for the A* Algorithm IJCAI 2018
Towards Bridging Resolution in German: Data Analysis and Rule-based Experiments NAACL 2018
Sampling-Based Approximation Algorithms for Reachability Analysis with Provable Guarantees RSS 2018
Complexity of Scheduling Charging in the Smart Grid IJCAI 2018
Fact-Alternating Mutex Groups for Classical Planning (Extended Abstract) IJCAI 2018
Efficient Large-Scale Approximate Nearest Neighbor Search on OpenCL FPGA CVPR 2018
Nonlinear Weighted Finite Automata AISTATS 2018
Linear Satisfiability Preserving Assignments (Extended Abstract) IJCAI 2018
Multi-agent Epistemic Planning with Common Knowledge IJCAI 2018
Improving Information Centrality of a Node in Complex Networks by Adding Edges IJCAI 2018
Cost-Based Goal Recognition for the Path-Planning Domain IJCAI 2018
Solving Sudoku with Consistency: A Visual and Interactive Approach IJCAI 2018
Maximin Share Allocations on Cycles IJCAI 2018
Solving the Perspective-2-Point Problem for Flying-Camera Photo Composition CVPR 2018
Computing the Schulze Method for Large-Scale Preference Data Sets IJCAI 2018
Found Graph Data and Planted Vertex Covers NIPS 2018
Content-Sensitive Supervoxels via Uniform Tessellations on Video Manifolds CVPR 2018
Structured Local Minima in Sparse Blind Deconvolution NIPS 2018
The Computational Complexity of Distinctive Feature Minimization in Phonology NAACL 2018
On the Duality Between Retinex and Image Dehazing CVPR 2018
Learning SMT(LRA) Constraints using SMT Solvers IJCAI 2018