Efficient Computing
8,226 papers
Papers per year
3
2
3
3
8
11
7
11
12
15
55
50
57
98
136
252
379
535
681
794
1,106
1,519
2,057
432
'5
'10
'15
'20
'25
Papers
The Pairwise Piecewise-Linear Embedding for Efficient Non-Linear Classification
ICML 2013
Analog readout for optical reservoir computers
NeurIPS 2012
Angular Quantization-based Binary Codes for Fast Similarity Search
NeurIPS 2012
Breaking the Curse of Kernelization: Budgeted Stochastic Gradient Descent for Large-Scale SVM Training
JMLR 2012
Classifier Cascade for Minimizing Feature Evaluation Cost
AISTATS 2012
DARWIN: A Framework for Machine Learning and Computer Vision Research and Development
JMLR 2012
Feature Clustering for Accelerating Parallel Coordinate Descent
NeurIPS 2012
Large-scale Linear Support Vector Regression
JMLR 2012
NIMFA : A Python Library for Nonnegative Matrix Factorization
JMLR 2012
One Permutation Hashing
NeurIPS 2012
Practical Large Scale Classification with Additive Kernels
ACML 2012
Scaling up Kernel SVM on Limited Resources: A Low-rank Linearization Approach
AISTATS 2012
Sketch-Based Linear Value Function Approximation
NeurIPS 2012
Super-Bit Locality-Sensitive Hashing
NeurIPS 2012
Timely Object Recognition
NeurIPS 2012
Visual Recognition using Embedded Feature Selection for Curvature Self-Similarity
NeurIPS 2012
Algorithms for Hyper-Parameter Optimization
NeurIPS 2011
Boosting with Maximum Adaptive Sampling
NeurIPS 2011
Dimensionality Reduction for Spectral Clustering
AISTATS 2011
Fast and Accurate k-means For Large Datasets
NeurIPS 2011
Fast and Balanced: Efficient Label Tree Learning for Large Scale Object Recognition
NeurIPS 2011
Hashing Algorithms for Large-Scale Learning
NeurIPS 2011
MSVMpack: A Multi-Class Support Vector Machine Package
JMLR 2011
Proximal Methods for Hierarchical Sparse Coding
JMLR 2011
Rapid Deformable Object Detection using Dual-Tree Branch-and-Bound
NeurIPS 2011