conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Discrete Optimization

705 papers

Papers per year

10
26
66
51
'10
'15
'20
'25

Papers

Generalized roof duality and bisubmodular functions NIPS 2010
Optimal Web-Scale Tiering as a Flow Problem NIPS 2010
Worst-case bounds on the quality of max-product fixed-points NIPS 2010
Efficient Minimization of Decomposable Submodular Functions NIPS 2010
Minimum Average Cost Clustering NIPS 2010
Segmentation as Maximum-Weight Independent Set NIPS 2010
MAP estimation in Binary MRFs via Bipartite Multi-cuts NIPS 2010
Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms AISTATS 2010
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching AISTATS 2010
An LP View of the M-best MAP problem NIPS 2009
Randomized Pruning: Efficiently Calculating Expectations in Large Dynamic Programs NIPS 2009
Local Rules for Global MAP: When Do They Work ? NIPS 2009
Beyond Convexity: Online Submodular Minimization NIPS 2009
MDPs with Non-Deterministic Policies NIPS 2008
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation NIPS 2008
Inferring rankings under constrained sensing NIPS 2008
Clustering via LP-based Stabilities NIPS 2008
An Online Algorithm for Maximizing Submodular Functions NIPS 2008
One sketch for all: Theory and Application of Conditional Random Sampling NIPS 2008
Learning Balls of Strings from Edit Corrections JMLR 2008
An Analysis of Convex Relaxations for MAP Estimation NIPS 2007
Local Algorithms for Approximate Inference in Minor-Excluded Graphs NIPS 2007
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations NIPS 2007
A Randomized Algorithm for Large Scale Support Vector Learning NIPS 2007
Efficient Inference for Distributions on Permutations NIPS 2007