Algorithms

Efficient Mechanism Design for Online Scheduling (Extended Abstract) IJCAI 2017 Efficient Optimal Search under Expensive Edge Cost Computation IJCAI 2017 Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Set EMNLP 2017 Fastron: An Online Learning-Based Model and Active Learning Strategy for Proxy Collision Detection CoRL 2017 Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions IJCAI 2017 Generalized Target Assignment and Path Finding Using Answer Set Programming IJCAI 2017 Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract) IJCAI 2017 GRASP: Rich Patterns for Argumentation Mining EMNLP 2017 Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms ICML 2017 Inapproximability of VC Dimension and Littlestone’s Dimension COLT 2017 Incremental Discontinuous Phrase Structure Parsing with the GAP Transition EACL 2017 K-best Iterative Viterbi Parsing EACL 2017 Learning to Run Heuristics in Tree Search IJCAI 2017 Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function (Extended Abstract) IJCAI 2017 Lossy Compression of Pattern Databases Using Acyclic Random Hypergraphs IJCAI 2017 MCMLSD: A Dynamic Programming Approach to Line Segment Detection CVPR 2017 Monolingual Phrase Alignment on Parse Forests EMNLP 2017 Multilingual Back-and-Forth Conversion between Content and Function Head for Easy Dependency Parsing EACL 2017 Multiwinner Rules on Paths From k-Borda to Chamberlin–Courant IJCAI 2017 On Neighborhood Singleton Consistencies IJCAI 2017 On Querying Incomplete Information in Databases under Bag Semantics IJCAI 2017 On the Kernelization of Global Constraints IJCAI 2017 On the Two-View Geometry of Unsynchronized Cameras CVPR 2017 “PageRank” for Argument Relevance EACL 2017 Parsing for Grammatical Relations via Graph Merging CoNLL 2017