Foundations

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 Practical Data-Dependent Metric Compression with Provable Guarantees NeurIPS 2017 Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs EMNLP 2017 Query Answering in Ontologies under Preference Rankings IJCAI 2017 Query Rewriting for DL-Lite with n-ary Concrete Domains IJCAI 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