Skip to content
conftrace_

submodular optimization

284 papers

Papers

An Efficient Streaming Algorithm for the Submodular Cover Problem NeurIPS 2016 Bi-Objective Online Matching and Submodular Allocations NeurIPS 2016 Causal meets Submodular: Subset Selection with Directed Information NeurIPS 2016 Computing and maximizing influence in linear threshold and triggering models NeurIPS 2016 Efficiently Creating 3D Training Data for Fine Hand Pose Estimation CVPR 2016 Efficient Point Process Inference for Large-Scale Object Detection CVPR 2016 Fast Constrained Submodular Maximization: Personalized Data Summarization ICML 2016 Gaussian quadrature for matrix inverse forms with applications ICML 2016 Learning Probabilistic Submodular Diversity Models Via Noise Contrastive Estimation AISTATS 2016 Leveraging Sparsity for Efficient Submodular Data Summarization NeurIPS 2016 Maximization of Approximately Submodular Functions NeurIPS 2016 Min Norm Point Algorithm for Higher Order MRF-MAP Inference CVPR 2016 On the Reducibility of Submodular Functions AISTATS 2016 Optimal Tagging with Markov Chain Optimization NeurIPS 2016 Structured Sparse Regression via Greedy Hard Thresholding NeurIPS 2016 The Power of Optimization from Samples NeurIPS 2016 Variational Inference in Mixed Probabilistic Submodular Models NeurIPS 2016 Adaptive Stochastic Optimization: From Sets to Paths NeurIPS 2015 A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice NeurIPS 2015 Distributed Submodular Cover: Succinctly Summarizing Massive Data NeurIPS 2015 Good Features to Track for Visual SLAM CVPR 2015 GRSA: Generalized Range Swap Algorithm for the Efficient Optimization of MRFs CVPR 2015 M-Best-Diverse Labelings for Submodular Energies and Beyond NeurIPS 2015 Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications NeurIPS 2015 Monotone k-Submodular Function Maximization with Size Constraints NeurIPS 2015