Foundations

Robust Feature Matching with Alternate Hough and Inverted Hough Transforms CVPR 2013 Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching NeurIPS 2013 Scalable Influence Estimation in Continuous-Time Diffusion Networks NeurIPS 2013 Scalable kernels for graphs with continuous attributes NeurIPS 2013 SIFTpack: A Compact Representation for Efficient SIFT Matching ICCV 2013 Single Image Calibration of Multi-axial Imaging Systems CVPR 2013 Strict Monotonicity of Sum of Squares Error and Normalized Cut in the Lattice of Clusterings ICML 2013 Subspace Embeddings and \ell_p-Regression Using Exponential Random Variables COLT 2013 The Generalized Laplacian Distance and Its Applications for Visual Matching CVPR 2013 The Power of Asymmetry in Binary Hashing NeurIPS 2013 Toward Guaranteed Illumination Models for Non-convex Objects ICCV 2013 Tree-Independent Dual-Tree Algorithms ICML 2013 Unsupervised Link Selection in Networks AISTATS 2013 Unsupervised Spectral Learning of Finite State Transducers NeurIPS 2013 Unsupervised Structure Learning of Stochastic And-Or Grammars NeurIPS 2013 Wavelets on Graphs via Deep Learning NeurIPS 2013 What is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? ICCV 2013 When in Doubt, SWAP: High-Dimensional Sparse Recovery from Correlated Measurements NeurIPS 2013 Which Space Partitioning Tree to Use for Search? NeurIPS 2013 A Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm ACML 2012 A Linear Time Active Learning Algorithm for Link Classification NeurIPS 2012 A Polylog Pivot Steps Simplex Algorithm for Classification NeurIPS 2012 A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound NeurIPS 2012 Attribute-Efficient Learning andWeight-Degree Tradeoffs for Polynomial Threshold Functions COLT 2012 Clustering Sparse Graphs NeurIPS 2012