Co-occurring keywords · papers mentioning both
Papers
Bethe Bounds and Approximating the Global Optimum
AISTATS 2013
Combinatorial Multi-Armed Bandit: General Framework and Applications
ICML 2013
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions
NeurIPS 2013
FasT-Match: Fast Affine Template Matching
CVPR 2013
Joint Geodesic Upsampling of Depth Images
CVPR 2013
Monochromatic Bi-Clustering
ICML 2013
Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees
COLT 2013
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints
NeurIPS 2013
Submodular Salient Region Detection
CVPR 2013
Approximating Concavely Parameterized Optimization Problems
NeurIPS 2012
Complexity of Bethe Approximation
AISTATS 2012
Data dependent kernels in nearly-linear time
AISTATS 2012
Near-Optimal MAP Inference for Determinantal Point Processes
NeurIPS 2012
On Bisubmodular Maximization
AISTATS 2012
Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem
COLT 2012
Approximating Semidefinite Programs in Sublinear Time
NeurIPS 2011
Scalable Training of Mixture Models via Coresets
NeurIPS 2011
Random Conic Pursuit for Semidefinite Programming
NeurIPS 2010
Approximating MAP by Compensating for Structural Relaxations
NeurIPS 2009
Local Rules for Global MAP: When Do They Work ?
NeurIPS 2009
Solving Stochastic Games
NeurIPS 2009
Streaming k-means approximation
NeurIPS 2009
Automatic online tuning for fast Gaussian summation
NeurIPS 2008
MAS: a multiplicative approximation scheme for probabilistic inference
NeurIPS 2008
On the Complexity of Learning Lexicographic Strategies
JMLR 2006