Algorithms

An Online Algorithm for Maximizing Submodular Functions NeurIPS 2008 Automatic online tuning for fast Gaussian summation NeurIPS 2008 Fast High-dimensional Kernel Summations Using the Monte Carlo Multipole Method NeurIPS 2008 Improved Moves for Truncated Convex Models NeurIPS 2008 Inferring rankings under constrained sensing NeurIPS 2008 One sketch for all: Theory and Application of Conditional Random Sampling NeurIPS 2008 Predictive Indexing for Fast Search NeurIPS 2008 QUIC-SVD: Fast SVD Using Cosine Trees NeurIPS 2008 A learning framework for nearest neighbor search NeurIPS 2007 Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning RSS 2007 Local Algorithms for Approximate Inference in Minor-Excluded Graphs 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 Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints 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 Query Transformations for Improving the Efficiency of ILP Systems JMLR 2003