← Optimization
Mathematics & Optimization › Optimization ›

Discrete Optimization

705 directly classified papers

Papers per year

Papers

Incorporating User Interaction and Topological Constraints within Contour Completion via Discrete Calculus CVPR 2013
Rounding Methods for Discrete Linear Classification ICML 2013
Near-optimal Batch Mode Active Learning and Adaptive Submodular Optimization ICML 2013
Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation NIPS 2013
Learning Valuation Functions COLT 2012
Online Sum-Product Computation Over Trees NIPS 2012
MAP Inference in Chains using Column Generation NIPS 2012
QBoost: Large Scale Classifier Training withAdiabatic Quantum Optimization ACML 2012
An Integer Optimization Approach to Associative Classification NIPS 2012
Minimizing Sparse High-Order Energies by Submodular Vertex-Cover NIPS 2012
On Bisubmodular Maximization AISTATS 2012
Submodular-Bregman and the Lovász-Bregman Divergences with Applications NIPS 2012
Efficient Sampling from Combinatorial Space via Bridging AISTATS 2012
(weak) Calibration is Computationally Hard COLT 2012
Globally Convergent Dual MAP LP Relaxation Solvers using Fenchel-Young Margins NIPS 2012
Randomized Optimum Models for Structured Prediction AISTATS 2012
Selecting Diverse Features via Spectral Regularization NIPS 2012
Near-Optimal MAP Inference for Determinantal Point Processes NIPS 2012
A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound NIPS 2012
Phase transition in the family of p-resistances NIPS 2011
Learning Higher-Order Graph Structure with Features by Structure Penalty NIPS 2011
On fast approximate submodular minimization NIPS 2011
Submodular Multi-Label Learning NIPS 2011
Scalable Training of Mixture Models via Coresets NIPS 2011
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching AISTATS 2010