← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Sparse Polynomial Learning and Graph Sketching NIPS 2014
Anti-differentiating approximation algorithms:A case study with min-cuts, spectral, and flow ICML 2014
Surface Registration by Optimization in Constrained Diffeomorphism Space CVPR 2014
In Defense of Minhash over Simhash AISTATS 2014
Additive Quantization for Extreme Vector Compression CVPR 2014
An Approximate, Efficient LP Solver for LP Rounding NIPS 2013
On the Learnability of Shuffle Ideals JMLR 2013
Dimension Independent Similarity Computation JMLR 2013
Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees COLT 2013
Robust Feature Matching with Alternate Hough and Inverted Hough Transforms CVPR 2013
Learning to Prune in Metric and Non-Metric Spaces NIPS 2013
Blind Calibration in Compressed Sensing using Message Passing Algorithms NIPS 2013
Near-Optimal Entrywise Sampling for Data Matrices NIPS 2013
Embed and Project: Discrete Sampling with Universal Hashing NIPS 2013
Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching NIPS 2013
Tree-Independent Dual-Tree Algorithms ICML 2013
A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles CVPR 2013
Depth Acquisition from Density Modulated Binary Patterns CVPR 2013
Randomized partition trees for exact nearest neighbor search COLT 2013
Single Image Calibration of Multi-axial Imaging Systems CVPR 2013
Articulated and Restricted Motion Subspaces and Their Signatures CVPR 2013
Improving the Visual Comprehension of Point Sets CVPR 2013
k-Prototype Learning for 3D Rigid Structures NIPS 2013
The Power of Asymmetry in Binary Hashing NIPS 2013
Algorithms and Hardness for Robust Subspace Recovery COLT 2013