Foundations

Rapid Deformable Object Detection using Dual-Tree Branch-and-Bound NeurIPS 2011 Reconstructing Patterns of Information Diffusion from Incomplete Observations NeurIPS 2011 Regularized Laplacian Estimation and Fast Eigenvector Approximation NeurIPS 2011 See the Tree Through the Lines: The Shazoo Algorithm NeurIPS 2011 SpaRCS: Recovering low-rank and sparse matrices from compressive measurements NeurIPS 2011 Sparse Features for PCA-Like Linear Regression NeurIPS 2011 Uniqueness of Belief Propagation on Signed Graphs NeurIPS 2011 A Molecular Algorithm for Path Self-Assembly in 3 Dimensions RSS 2010 b-Bit Minwise Hashing for Estimating Three-Way Similarities NeurIPS 2010 Efficient Minimization of Decomposable Submodular Functions NeurIPS 2010 Extensions of Generalized Binary Search to Group Identification and Exponential Costs NeurIPS 2010 Getting lost in space: Large sample analysis of the resistance distance NeurIPS 2010 Identifying graph-structured activation patterns in networks NeurIPS 2010 Learning the Structure of Deep Sparse Graphical Models AISTATS 2010 Link Discovery using Graph Feature Tracking NeurIPS 2010 Penalized Principal Component Regression on Graphs for Analysis of Subnetworks NeurIPS 2010 Probabilistic Deterministic Infinite Automata NeurIPS 2010 Random Projections for k-means Clustering NeurIPS 2010 Random Projection Trees Revisited NeurIPS 2010 Single versus Multiple Sorting in All Pairs Similarity Search ACML 2010 Subgraph Detection Using Eigenvector L1 Norms NeurIPS 2010 A Game-Theoretic Approach to Hypergraph Clustering NeurIPS 2009 An Integer Projected Fixed Point Method for Graph Matching and MAP Inference NeurIPS 2009 Complexity of Decentralized Control: Special Cases NeurIPS 2009 Efficient Bregman Range Search NeurIPS 2009