combinatorial optimization

A* Lasso for Learning a Sparse Bayesian Network Structure for Continuous Variables NeurIPS 2013 Bethe Bounds and Approximating the Global Optimum AISTATS 2013 Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs ICML 2013 Convex Relaxations for Permutation Problems NeurIPS 2013 Embed and Project: Discrete Sampling with Universal Hashing NeurIPS 2013 Experiment Selection for Causal Discovery JMLR 2013 Fast Semidifferential-based Submodular Function Optimization ICML 2013 Finding Optimal Bayesian Networks Using Precedence Constraints JMLR 2013 Gauging Association Patterns of Chromosome Territories via Chromatic Median CVPR 2013 Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation NeurIPS 2013 GrabCut in One Cut ICCV 2013 Matrix factorization with binary components NeurIPS 2013 Monochromatic Bi-Clustering ICML 2013 Potts Model, Parametric Maxflow and K-Submodular Functions ICCV 2013 Prediction by random-walk perturbation COLT 2013 Reflection methods for user-friendly submodular optimization NeurIPS 2013 Rounding Methods for Discrete Linear Classification ICML 2013 Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints NeurIPS 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 Distributable and Computation-flexible Assignment Algorithm: From Local Task Swapping to Global Optimality RSS 2012 An Integer Optimization Approach to Associative Classification NeurIPS 2012 Clustering Aggregation as Maximum-Weight Independent Set NeurIPS 2012 Efficient and Exact MAP-MRF Inference using Branch and Bound AISTATS 2012 Efficient Sampling from Combinatorial Space via Bridging AISTATS 2012