Foundations

Exponential Family Graph Matching and Ranking 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 Matrix Completion from Power-Law Distributed Samples 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 An Online Algorithm for Maximizing Submodular Functions NeurIPS 2008 Automatic online tuning for fast Gaussian summation NeurIPS 2008 Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation NeurIPS 2008 Cyclizing Clusters via Zeta Function of a Graph NeurIPS 2008 Fast High-dimensional Kernel Summations Using the Monte Carlo Multipole Method NeurIPS 2008 Fast Prediction on a Tree NeurIPS 2008 Improved Moves for Truncated Convex Models NeurIPS 2008 Inferring rankings under constrained sensing NeurIPS 2008 Influence of graph construction on graph-based clustering measures NeurIPS 2008 Learning Balls of Strings from Edit Corrections JMLR 2008 Measures of Clustering Quality: A Working Set of Axioms for Clustering NeurIPS 2008 One sketch for all: Theory and Application of Conditional Random Sampling NeurIPS 2008