← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Hierarchical Clustering via Spreading Metrics NIPS 2016
The Chordal Graph Polytope for Learning Decomposable Models PGM 2016
Communication-Optimal Distributed Clustering NIPS 2016
Iterative Hessian Sketch: Fast and Accurate Solution Approximation for Constrained Least-Squares JMLR 2016
An algorithm for L1 nearest neighbor search via monotonic embedding NIPS 2016
Fast Detection of Curved Edges at Low SNR CVPR 2016
Speeding up k-means by approximating Euclidean distances via block vectors ICML 2016
Principal Component Projection Without Principal Component Analysis ICML 2016
Efficient Intersection of Three Quadrics and Applications in Computer Vision CVPR 2016
Efficient Globally Optimal 2D-To-3D Deformable Shape Matching CVPR 2016
The Global Patch Collider CVPR 2016
TensorFlow: A System for Large-Scale Machine Learning OSDI 2016
FANNG: Fast Approximate Nearest Neighbour Graphs CVPR 2016
Globally Optimal Manhattan Frame Estimation in Real-Time CVPR 2016
Guaranteed Outlier Removal With Mixed Integer Linear Programs CVPR 2016
An Efficient Streaming Algorithm for the Submodular Cover Problem NIPS 2016
GRAPHENE: Packing and Dependency-Aware Scheduling for Data-Parallel Clusters OSDI 2016
Single Pass PCA of Matrix Products NIPS 2016
SPALS: Fast Alternating Least Squares via Implicit Leverage Scores Sampling NIPS 2016
Optimal Relative Pose With Unknown Correspondences CVPR 2016
Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing ICML 2016
A Novel Relationship Between Dynamics and Complexity in Multi-agent Collision Avoidance RSS 2016
Computationally Efficient Nyström Approximation using Fast Transforms ICML 2016
Phrase-based Machine Translation using Multiple Preordering Candidates COLING 2016
A subtree-based factorization of dependency parsing COLING 2016