Foundations

Online Prediction on Large Diameter Graphs NeurIPS 2008 Predictive Indexing for Fast Search NeurIPS 2008 QUIC-SVD: Fast SVD Using Cosine Trees NeurIPS 2008 Spectral Hashing NeurIPS 2008 A learning framework for nearest neighbor search NeurIPS 2007 Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning RSS 2007 Kernels on Attributed Pointsets with Applications NeurIPS 2007 Learning the structure of manifolds using random projections NeurIPS 2007 Local Algorithms for Approximate Inference in Minor-Excluded Graphs NeurIPS 2007 Message Passing for Max-weight Independent Set NeurIPS 2007 Random Sampling of States in Dynamic Programming NeurIPS 2007 A Small World Threshold for Economic Network Formation NeurIPS 2006 Attribute-efficient learning of decision lists and linear threshold functions under unconcentrated distributions NeurIPS 2006 Balanced Graph Matching NeurIPS 2006 Computation of Similarity Measures for Sequential Data using Generalized Suffix Trees NeurIPS 2006 Conditional Random Sampling: A Sketch-based Sampling Technique for Sparse Data NeurIPS 2006 Fast Computation of Graph Kernels NeurIPS 2006 Learnability and the doubling dimension NeurIPS 2006 Learning with Hypergraphs: Clustering, Classification, and Embedding NeurIPS 2006 Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints NeurIPS 2006 On the Relation Between Low Density Separation, Spectral Clustering and Graph Cuts NeurIPS 2006 Ordinal Regression by Extended Binary Classification NeurIPS 2006 Prediction on a Graph with a Perceptron NeurIPS 2006 Shifting, One-Inclusion Mistake Bounds and Tight Multiclass Expected Risk Bounds NeurIPS 2006 Effcient Motion Planning Based on Disassembly RSS 2005