Algorithms

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 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 Learning the Structure of Deep Sparse Graphical Models AISTATS 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 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 Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection JMLR 2009 Fast subtree kernels on graphs NeurIPS 2009 Linear-time Algorithms for Pairwise Statistical Problems NeurIPS 2009 Locality-sensitive binary codes from shift-invariant kernels NeurIPS 2009 Local Rules for Global MAP: When Do They Work ? NeurIPS 2009 Maximum likelihood trajectories for continuous-time Markov chains NeurIPS 2009 Noisy Generalized Binary Search NeurIPS 2009 Randomized Pruning: Efficiently Calculating Expectations in Large Dynamic Programs NeurIPS 2009 Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions NeurIPS 2009 Streaming k-means approximation NeurIPS 2009 Streaming Pointwise Mutual Information NeurIPS 2009