← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Efficient Bregman Range Search NIPS 2009
Randomized Pruning: Efficiently Calculating Expectations in Large Dynamic Programs NIPS 2009
An Integer Projected Fixed Point Method for Graph Matching and MAP Inference NIPS 2009
Automatic online tuning for fast Gaussian summation NIPS 2008
One sketch for all: Theory and Application of Conditional Random Sampling NIPS 2008
QUIC-SVD: Fast SVD Using Cosine Trees NIPS 2008
Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning RSS 2007
A learning framework for nearest neighbor search NIPS 2007
Local Algorithms for Approximate Inference in Minor-Excluded Graphs NIPS 2007
Prediction on a Graph with a Perceptron NIPS 2006
Learnability and the doubling dimension NIPS 2006
Computation of Similarity Measures for Sequential Data using Generalized Suffix Trees NIPS 2006
A Small World Threshold for Economic Network Formation NIPS 2006
Shifting, One-Inclusion Mistake Bounds and Tight Multiclass Expected Risk Bounds NIPS 2006
Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints NIPS 2006
Ordinal Regression by Extended Binary Classification NIPS 2006
Balanced Graph Matching NIPS 2006
Effcient Motion Planning Based on Disassembly RSS 2005
Query Transformations for Improving the Efficiency of ILP Systems JMLR 2003
Efficient Algorithms for Decision Tree Cross-validation JMLR 2002