combinatorial optimization

GenDeR: A Generic Diversified Ranking Algorithm NeurIPS 2012 Globally Optimizing Graph Partitioning Problems Using Message Passing AISTATS 2012 High-Rank Matrix Completion AISTATS 2012 Learning Valuation Functions COLT 2012 Minimizing Sparse High-Order Energies by Submodular Vertex-Cover NeurIPS 2012 Submodular-Bregman and the Lovász-Bregman Divergences with Applications NeurIPS 2012 The Lovász ϑ function, SVMs and finding large dense subgraphs NeurIPS 2012 Topology Constraints in Graphical Models NeurIPS 2012 Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts NeurIPS 2011 Fast b-matching via Sufficient Selection Belief Propagation AISTATS 2011 Minimax Localization of Structural Information in Large Noisy Matrices NeurIPS 2011 Minimax Policies for Combinatorial Prediction Games COLT 2011 On fast approximate submodular minimization NeurIPS 2011 Phase transition in the family of p-resistances NeurIPS 2011 Prismatic Algorithm for Discrete D.C. Programming Problem NeurIPS 2011 Projection onto A Nonnegative Max-Heap NeurIPS 2011 Reconstructing Patterns of Information Diffusion from Incomplete Observations NeurIPS 2011 Submodular Multi-Label Learning NeurIPS 2011 Active Instance Sampling via Matrix Partition NeurIPS 2010 Bayesian structure discovery in Bayesian networks with less space AISTATS 2010 Efficient Minimization of Decomposable Submodular Functions NeurIPS 2010 Learning Bayesian Network Structure using LP Relaxations AISTATS 2010 MAP estimation in Binary MRFs via Bipartite Multi-cuts NeurIPS 2010 Non-Stochastic Bandit Slate Problems NeurIPS 2010 On-Line Sequential Bin Packing JMLR 2010