← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Monolingual Phrase Alignment on Parse Forests EMNLP 2017
Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Set EMNLP 2017
GRASP: Rich Patterns for Argumentation Mining EMNLP 2017
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NIPS 2017
A Maximum Matching Algorithm for Basis Selection in Spectral Learning AISTATS 2017
A Sub-Quadratic Exact Medoid Algorithm AISTATS 2017
Multiwinner Rules on Paths From k-Borda to Chamberlin–Courant IJCAI 2017
A Core-Guided Approach to Learning Optimal Causal Graphs IJCAI 2017
An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers IJCAI 2017
Constraint Games revisited IJCAI 2017
The Tractability of the Shapley Value over Bounded Treewidth Matching Games IJCAI 2017
Generalized Target Assignment and Path Finding Using Answer Set Programming IJCAI 2017
Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method IJCAI 2017
Incremental Discontinuous Phrase Structure Parsing with the GAP Transition EACL 2017
“PageRank” for Argument Relevance EACL 2017
Affinity Clustering: Hierarchical Clustering at Scale NIPS 2017
Practical Data-Dependent Metric Compression with Provable Guarantees NIPS 2017
Clustering Stable Instances of Euclidean k-means. NIPS 2017
Search Strategies as Synchronous Processes (Extended Abstract) IJCAI 2017
The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas IJCAI 2017
A General Multi-agent Epistemic Planner Based on Higher-order Belief Change IJCAI 2017
CCEHC: An Efficient Local Search Algorithm for Weighted Partial Maximum Satisfiability (Extended Abstract) IJCAI 2017
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions IJCAI 2017
On the Kernelization of Global Constraints IJCAI 2017
LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain NIPS 2016