combinatorial optimization

Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure JMLR 2010 Optimal Web-Scale Tiering as a Flow Problem NeurIPS 2010 Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching AISTATS 2010 Segmentation as Maximum-Weight Independent Set NeurIPS 2010 Variational Inference over Combinatorial Spaces NeurIPS 2010 A Game-Theoretic Approach to Hypergraph Clustering NeurIPS 2009 An Analysis of Convex Relaxations for MAP Estimation of Discrete MRFs JMLR 2009 An Integer Projected Fixed Point Method for Graph Matching and MAP Inference NeurIPS 2009 An LP View of the M-best MAP problem NeurIPS 2009 Local Rules for Global MAP: When Do They Work ? NeurIPS 2009 Submodularity Cuts and Applications NeurIPS 2009 An Extended Level Method for Efficient Multiple Kernel Learning NeurIPS 2008 Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation NeurIPS 2008 Inferring rankings under constrained sensing NeurIPS 2008 Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies JMLR 2008 Efficient Convex Relaxation for Transductive Support Vector Machine NeurIPS 2007 Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations NeurIPS 2007 Linear programming analysis of loopy belief propagation for weighted matching NeurIPS 2007 Local Algorithms for Approximate Inference in Minor-Excluded Graphs NeurIPS 2007 Message Passing for Max-weight Independent Set NeurIPS 2007 Non-parametric Modeling of Partially Ranked Data NeurIPS 2007 Balanced Graph Matching NeurIPS 2006 Ensemble Pruning Via Semi-definite Programming JMLR 2006 Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems JMLR 2006 Linear Programming Relaxations and Belief Propagation -- An Empirical Study JMLR 2006