conftrace_
← Foundations
Computer Science › Foundations ›

Algorithms

1,298 papers

Papers per year

1
6
27
149
97
'05
'10
'15
'20
'25

Papers

Rapid Deformable Object Detection using Dual-Tree Branch-and-Bound NIPS 2011
Hashing Algorithms for Large-Scale Learning NIPS 2011
Nearest Neighbor based Greedy Coordinate Descent NIPS 2011
Convergent Bounds on the Euclidean Distance NIPS 2011
Approximating Semidefinite Programs in Sublinear Time NIPS 2011
Fast and Accurate k-means For Large Datasets NIPS 2011
Prismatic Algorithm for Discrete D.C. Programming Problem NIPS 2011
See the Tree Through the Lines: The Shazoo Algorithm NIPS 2011
Algorithms and hardness results for parallel large margin learning NIPS 2011
Randomized Algorithms for Comparison-based Search NIPS 2011
Multiple Instance Learning on Structured Data NIPS 2011
Learning to Search Efficiently in High Dimensions NIPS 2011
Reconstructing Patterns of Information Diffusion from Incomplete Observations NIPS 2011
A New Algorithm for Compressed Counting with Applications in Shannon Entropy Estimation in Dynamic Data COLT 2011
Identification and Representation of Homotopy Classes of Trajectories for Search-based Path Planning in 3D RSS 2011
b-Bit Minwise Hashing for Estimating Three-Way Similarities NIPS 2010
Random Projection Trees Revisited NIPS 2010
Efficient Minimization of Decomposable Submodular Functions NIPS 2010
Single versus Multiple Sorting in All Pairs Similarity Search ACML 2010
Learning the Structure of Deep Sparse Graphical Models AISTATS 2010
A Molecular Algorithm for Path Self-Assembly in 3 Dimensions RSS 2010
Fast subtree kernels on graphs NIPS 2009
Linear-time Algorithms for Pairwise Statistical Problems NIPS 2009
Streaming k-means approximation NIPS 2009
Noisy Generalized Binary Search NIPS 2009