Foundations

Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem COLT 2012 Wavelet based multi-scale shape features on arbitrary surfaces for cortical thickness discrimination NeurIPS 2012 (weak) Calibration is Computationally Hard COLT 2012 Active Ranking using Pairwise Comparisons NeurIPS 2011 Algorithms and hardness results for parallel large margin learning NeurIPS 2011 A New Algorithm for Compressed Counting with Applications in Shannon Entropy Estimation in Dynamic Data COLT 2011 Approximating Semidefinite Programs in Sublinear Time NeurIPS 2011 Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts NeurIPS 2011 Convergent Bounds on the Euclidean Distance NeurIPS 2011 Data Skeletonization via Reeb Graphs NeurIPS 2011 Exploiting spatial overlap to efficiently compute appearance distances between image windows NeurIPS 2011 Fast and Accurate k-means For Large Datasets NeurIPS 2011 From Bandits to Experts: On the Value of Side-Observations NeurIPS 2011 Hashing Algorithms for Large-Scale Learning NeurIPS 2011 Identification and Representation of Homotopy Classes of Trajectories for Search-based Path Planning in 3D RSS 2011 Learning to Search Efficiently in High Dimensions NeurIPS 2011 Maximal Cliques that Satisfy Hard Constraints with Application to Deformable Object Model Learning NeurIPS 2011 Multiple Instance Learning on Structured Data NeurIPS 2011 Nearest Neighbor based Greedy Coordinate Descent NeurIPS 2011 Nonstandard Interpretations of Probabilistic Programs for Efficient Inference NeurIPS 2011 Orthogonal Matching Pursuit with Replacement NeurIPS 2011 Phase transition in the family of p-resistances NeurIPS 2011 Prismatic Algorithm for Discrete D.C. Programming Problem NeurIPS 2011 Projection onto A Nonnegative Max-Heap NeurIPS 2011 Randomized Algorithms for Comparison-based Search NeurIPS 2011