Discrete Optimization

Robust Budget Allocation via Continuous Submodular Functions ICML 2017 Softpressure: A Schedule-Driven Backpressure Algorithm for Coping with Network Congestion IJCAI 2017 Stochastic Submodular Maximization: The Case of Coverage Functions NeurIPS 2017 Streaming Weak Submodularity: Interpreting Neural Networks on the Fly NeurIPS 2017 Temporal Planning with Clock-Based SMT Encodings IJCAI 2017 The limits of automatic summarisation according to ROUGE EACL 2017 Top-k Supervise Feature Selection via ADMM for Integer Programming IJCAI 2017 Towards Abstractive Multi-Document Summarization Using Submodular Function-Based Framework, Sentence Compression and Merging IJCNLP 2017 A Novel Relationship Between Dynamics and Complexity in Multi-agent Collision Avoidance RSS 2016 Assortment Optimization Under the Mallows model NeurIPS 2016 A subtree-based factorization of dependency parsing COLING 2016 Efficient Point Process Inference for Large-Scale Object Detection CVPR 2016 Greedy Column Subset Selection: New Bounds and Distributed Algorithms ICML 2016 Improved Hamming Distance Search Using Variable Length Substrings CVPR 2016 Joint Probabilistic Matching Using m-Best Solutions CVPR 2016 Learning Acyclic Directed Mixed Graphs from Observations and Interventions PGM 2016 Maximization of Approximately Submodular Functions NeurIPS 2016 Pairwise Matching Through Max-Weight Bipartite Belief Propagation CVPR 2016 Phrase-based Machine Translation using Multiple Preordering Candidates COLING 2016 Pruning Random Forests for Prediction on a Budget NeurIPS 2016 Solving Marginal MAP Problems with NP Oracles and Parity Constraints NeurIPS 2016 Solving Temporal Puzzles CVPR 2016 The Chordal Graph Polytope for Learning Decomposable Models PGM 2016 The Effect of Combination Functions on the Complexity of Relational Bayesian Networks PGM 2016 The Parameterized Complexity of Approximate Inference in Bayesian Networks PGM 2016