Approximation Algorithms

Simple and Efficient Weighted Minwise Hashing NeurIPS 2016 Single Pass PCA of Matrix Products NeurIPS 2016 Sublinear Time Orthogonal Tensor Decomposition NeurIPS 2016 The Power of Optimization from Samples NeurIPS 2016 A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice NeurIPS 2015 Approximating Sparse PCA from Incomplete Data NeurIPS 2015 Distributed Submodular Cover: Succinctly Summarizing Massive Data NeurIPS 2015 Fast Distributed k-Center Clustering with Outliers on Massive Data NeurIPS 2015 Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications NeurIPS 2015 Monotone k-Submodular Function Maximization with Size Constraints NeurIPS 2015 Optimal Rates for Random Fourier Features NeurIPS 2015 Smooth Interactive Submodular Set Cover NeurIPS 2015 Submodular Hamming Metrics NeurIPS 2015 Coresets for k-Segmentation of Streaming Data NeurIPS 2014 Distributed Balanced Clustering via Mapping Coresets NeurIPS 2014 Fast Rotation Search with Stereographic Projections for 3D Registration CVPR 2014 Low Rank Approximation Lower Bounds in Row-Update Streams NeurIPS 2014 Parallel Double Greedy Submodular Maximization NeurIPS 2014 Stochastic Network Design in Bidirected Trees NeurIPS 2014 Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints NeurIPS 2013 When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity NeurIPS 2013 Approximating Concavely Parameterized Optimization Problems NeurIPS 2012 Near-Optimal MAP Inference for Determinantal Point Processes NeurIPS 2012 An Application of Tree-Structured Expectation Propagation for Channel Decoding NeurIPS 2011 Approximating Semidefinite Programs in Sublinear Time NeurIPS 2011