Discrete Mathematics

A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice NeurIPS 2015 Agnostic Learning of Disjunctions on Symmetric Distributions JMLR 2015 A Provable Generalized Tensor Spectral Method for Uniform Hypergraph Partitioning ICML 2015 Distributed Submodular Cover: Succinctly Summarizing Massive Data NeurIPS 2015 Distributional Rank Aggregation, and an Axiomatic Analysis ICML 2015 Generalized Deformable Spatial Pyramid: Geometry-Preserving Dense Correspondence Estimation CVPR 2015 Learnability of Solutions to Conjunctive Queries: The Full Dichotomy COLT 2015 Lifted Symmetry Detection and Breaking for MAP Inference NeurIPS 2015 Submodular Hamming Metrics NeurIPS 2015 The Algebraic Combinatorial Approach for Low-Rank Matrix Completion JMLR 2015 A Fast and Robust Algorithm to Count Topologically Persistent Holes in Noisy Clouds CVPR 2014 Computational Limits for Matrix Completion COLT 2014 Learning Shuffle Ideals Under Restricted Distributions NeurIPS 2014 Learning to Discover Efficient Mathematical Identities NeurIPS 2014 Low-density Parity Constraints for Hashing-Based Discrete Integration ICML 2014 Maximum Persistency in Energy Minimization CVPR 2014 Sparse Polynomial Learning and Graph Sketching NeurIPS 2014 Fluttering Pattern Generation Using Modified Legendre Sequence for Coded Exposure Imaging ICCV 2013 On the Complexity and Approximation of Binary Evidence in Lifted Inference NeurIPS 2013 Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights COLT 2013 Potts Model, Parametric Maxflow and K-Submodular Functions ICCV 2013 Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization CVPR 2013 Attribute-Efficient Learning andWeight-Degree Tradeoffs for Polynomial Threshold Functions COLT 2012 Fast Resampling Weighted v-Statistics NeurIPS 2012 Learning DNF Expressions from Fourier Spectrum COLT 2012