Combinatorial Optimization

Rounding Methods for Discrete Linear Classification ICML 2013 Scalable Influence Estimation in Continuous-Time Diffusion Networks NeurIPS 2013 Scaling the Indian Buffet Process via Submodular Maximization ICML 2013 Semi-Supervised Learning Using Greedy Max-Cut JMLR 2013 Shape from Silhouette Probability Maps: Reconstruction of Thin Objects in the Presence of Silhouette Extraction and Calibration Error CVPR 2013 Strict Monotonicity of Sum of Squares Error and Normalized Cut in the Lattice of Clusterings ICML 2013 Structured Learning of Sum-of-Submodular Higher Order Energy Functions ICCV 2013 Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints NeurIPS 2013 Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows JMLR 2013 Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization ICML 2013 Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization CVPR 2013 A Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm ACML 2012 A Divide-and-Conquer Method for Sparse Inverse Covariance Estimation NeurIPS 2012 An Integer Optimization Approach to Associative Classification NeurIPS 2012 Clustering Aggregation as Maximum-Weight Independent Set NeurIPS 2012 Efficiently finding optimal winding-constrained loops in the plane RSS 2012 Efficient Sampling for Bipartite Matching Problems NeurIPS 2012 Efficient Sampling from Combinatorial Space via Bridging AISTATS 2012 Fast Resampling Weighted v-Statistics NeurIPS 2012 Globally Optimizing Graph Partitioning Problems Using Message Passing AISTATS 2012 High-dimensional Sparse Inverse Covariance Estimation using Greedy Methods AISTATS 2012 MAP Inference in Chains using Column Generation NeurIPS 2012 Minimizing Sparse High-Order Energies by Submodular Vertex-Cover NeurIPS 2012 Minimizing Uncertainty in Pipelines NeurIPS 2012 Multi-objective Monte-Carlo Tree Search ACML 2012