← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Algorithms and hardness results for parallel large margin learning NIPS 2011
Multiple Instance Learning on Structured Data NIPS 2011
See the Tree Through the Lines: The Shazoo Algorithm NIPS 2011
Hashing Algorithms for Large-Scale Learning NIPS 2011
Fast and Accurate k-means For Large Datasets NIPS 2011
Prismatic Algorithm for Discrete D.C. Programming Problem NIPS 2011
Reconstructing Patterns of Information Diffusion from Incomplete Observations NIPS 2011
Randomized Algorithms for Comparison-based Search NIPS 2011
Identification and Representation of Homotopy Classes of Trajectories for Search-based Path Planning in 3D RSS 2011
Rapid Deformable Object Detection using Dual-Tree Branch-and-Bound NIPS 2011
Nearest Neighbor based Greedy Coordinate Descent NIPS 2011
Convergent Bounds on the Euclidean Distance NIPS 2011
Learning the Structure of Deep Sparse Graphical Models AISTATS 2010
b-Bit Minwise Hashing for Estimating Three-Way Similarities NIPS 2010
Single versus Multiple Sorting in All Pairs Similarity Search ACML 2010
Random Projection Trees Revisited NIPS 2010
Efficient Minimization of Decomposable Submodular Functions NIPS 2010
A Molecular Algorithm for Path Self-Assembly in 3 Dimensions RSS 2010
Streaming k-means approximation NIPS 2009
Locality-sensitive binary codes from shift-invariant kernels NIPS 2009
Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions NIPS 2009
Noisy Generalized Binary Search NIPS 2009
Linear-time Algorithms for Pairwise Statistical Problems NIPS 2009
Fast subtree kernels on graphs NIPS 2009
Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection JMLR 2009