Foundations

Tight Bounds for Influence in Diffusion Networks and Application to Bond Percolation and Epidemiology NeurIPS 2014 Tight Continuous Relaxation of the Balanced k-Cut Problem NeurIPS 2014 Unsupervised Deep Haar Scattering on Graphs NeurIPS 2014 Zeta Hull Pursuits: Learning Nonconvex Data Hulls NeurIPS 2014 Adaptive Anonymity via b-Matching NeurIPS 2013 A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles CVPR 2013 A* Lasso for Learning a Sparse Bayesian Network Structure for Continuous Variables NeurIPS 2013 Algorithms and Hardness for Robust Subspace Recovery COLT 2013 Analyzing the Harmonic Structure in Graph-Based Learning NeurIPS 2013 An Approximate, Efficient LP Solver for LP Rounding NeurIPS 2013 A Practical Rank-Constrained Eight-Point Algorithm for Fundamental Matrix Estimation CVPR 2013 Articulated and Restricted Motion Subspaces and Their Signatures CVPR 2013 Bayesian Hierarchical Community Discovery NeurIPS 2013 Beyond Pairwise: Provably Fast Algorithms for Approximate k-Way Similarity Search NeurIPS 2013 Blind Calibration in Compressed Sensing using Message Passing Algorithms NeurIPS 2013 Deformable Graph Matching CVPR 2013 Density estimation from unweighted k-nearest neighbor graphs: a roadmap NeurIPS 2013 Depth Acquisition from Density Modulated Binary Patterns CVPR 2013 Dimension Independent Similarity Computation JMLR 2013 Efficient Algorithm for Privately Releasing Smooth Queries NeurIPS 2013 Efficient Computation of Shortest Path-Concavity for 3D Meshes CVPR 2013 Elastic Net Constraints for Shape Matching ICCV 2013 Embed and Project: Discrete Sampling with Universal Hashing NeurIPS 2013 Estimating the Unseen: Improved Estimators for Entropy and other Properties NeurIPS 2013 Fast Template Evaluation with Vector Quantization NeurIPS 2013