conftrace_

approximation algorithm

630 papers

Explore in graph

Also known as

APPROX

Co-occurring keywords

combinatorial optimization (1039) submodular maximization (143) submodular optimization (261) k-means clustering (235) greedy algorithm (242) mechanism design (340) fair division (158) submodular function (121) hierarchical clustering (232) graph algorithm (178)

Papers

Nonnegative Sparse PCA with Provable Guarantees ICML 2014
Coresets for k-Segmentation of Streaming Data NIPS 2014
Anti-differentiating approximation algorithms:A case study with min-cuts, spectral, and flow ICML 2014
Stochastic Network Design in Bidirected Trees NIPS 2014
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm ICML 2014
The Complexity of Learning Halfspaces using Generalized Linear Methods COLT 2014
FasT-Match: Fast Affine Template Matching CVPR 2013
Joint Geodesic Upsampling of Depth Images CVPR 2013
Combinatorial Multi-Armed Bandit: General Framework and Applications ICML 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 NIPS 2013
Bethe Bounds and Approximating the Global Optimum AISTATS 2013
Submodular Salient Region Detection CVPR 2013
On Bisubmodular Maximization AISTATS 2012
Near-Optimal MAP Inference for Determinantal Point Processes NIPS 2012
Approximating Concavely Parameterized Optimization Problems NIPS 2012
Data dependent kernels in nearly-linear time AISTATS 2012
Complexity of Bethe Approximation AISTATS 2012
Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem COLT 2012
Scalable Training of Mixture Models via Coresets NIPS 2011
Approximating Semidefinite Programs in Sublinear Time NIPS 2011
Approximating MAP by Compensating for Structural Relaxations NIPS 2009
Streaming k-means approximation NIPS 2009
Local Rules for Global MAP: When Do They Work ? NIPS 2009