Skip to content
conftrace_

computational complexity

452 papers

Papers

Learning the Structure of Variable-Order CRFs: a finite-state perspective EMNLP 2017 Manipulating Opinion Diffusion in Social Networks IJCAI 2017 More Is Less: A More Complicated Network With Less Inference Complexity CVPR 2017 New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition (Extended Abstract) IJCAI 2017 On Coalitional Manipulation for Multiwinner Elections: Shortlisting IJCAI 2017 On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks IJCAI 2017 On the Complexity of Learning from Label Proportions IJCAI 2017 On the Computational Complexity of Gossip Protocols IJCAI 2017 On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks NeurIPS 2017 Pure Nash Equilibria in Online Fair Division IJCAI 2017 Query Conservative Extensions in Horn Description Logics with Inverse Roles IJCAI 2017 Reducing the Computational Complexity of Two-Dimensional LSTMs Interspeech 2017 Searching for Well-Behaved Fragments of Halpern-Shoham Logic IJCAI 2017 The Complexity of Explaining Neural Networks Through (group) Invariants ALT 2017 The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality IJCAI 2017 The Impact of Treewidth on ASP Grounding and Solving IJCAI 2017 The limits of automatic summarisation according to ROUGE EACL 2017 A Guide to Learning Arithmetic Circuits COLT 2016 Automatic Image Cropping : A Computational Complexity Study CVPR 2016 Average-case hardness of RIP certification NeurIPS 2016 Fast Algorithms for Robust PCA via Gradient Descent NeurIPS 2016 More Supervision, Less Computation: Statistical-Computational Tradeoffs in Weakly Supervised Learning NeurIPS 2016 On the Approximability of Sparse PCA COLT 2016 Reducing the Computational Complexity of Multimicrophone Acoustic Models with Integrated Feature Extraction Interspeech 2016 Sub-sampled Newton Methods with Non-uniform Sampling NeurIPS 2016