Algorithms
1,701 papers
Papers per year
1
1
1
11
4
8
14
8
21
27
50
43
38
32
65
94
127
163
161
169
168
221
200
74
'5
'10
'15
'20
'25
Papers
Scalable nonconvex inexact proximal splitting
NeurIPS 2012
Spectral Learning of General Weighted Automata via Constrained Matrix Completion
NeurIPS 2012
Super-Bit Locality-Sensitive Hashing
NeurIPS 2012
Tight Bounds on Proper Equivalence Query Learning of DNF
COLT 2012
Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem
COLT 2012
Wavelet based multi-scale shape features on arbitrary surfaces for cortical thickness discrimination
NeurIPS 2012
(weak) Calibration is Computationally Hard
COLT 2012
Active Ranking using Pairwise Comparisons
NeurIPS 2011
Algorithms and hardness results for parallel large margin learning
NeurIPS 2011
A New Algorithm for Compressed Counting with Applications in Shannon Entropy Estimation in Dynamic Data
COLT 2011
Approximating Semidefinite Programs in Sublinear Time
NeurIPS 2011
Convergent Bounds on the Euclidean Distance
NeurIPS 2011
Exploiting spatial overlap to efficiently compute appearance distances between image windows
NeurIPS 2011
Fast and Accurate k-means For Large Datasets
NeurIPS 2011
Hashing Algorithms for Large-Scale Learning
NeurIPS 2011
Identification and Representation of Homotopy Classes of Trajectories for Search-based Path Planning in 3D
RSS 2011
Learning to Search Efficiently in High Dimensions
NeurIPS 2011
Multiple Instance Learning on Structured Data
NeurIPS 2011
Nearest Neighbor based Greedy Coordinate Descent
NeurIPS 2011
Orthogonal Matching Pursuit with Replacement
NeurIPS 2011
Prismatic Algorithm for Discrete D.C. Programming Problem
NeurIPS 2011
Projection onto A Nonnegative Max-Heap
NeurIPS 2011
Randomized Algorithms for Comparison-based Search
NeurIPS 2011
Rapid Deformable Object Detection using Dual-Tree Branch-and-Bound
NeurIPS 2011
Reconstructing Patterns of Information Diffusion from Incomplete Observations
NeurIPS 2011