← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Subspace Embeddings and \ell_p-Regression Using Exponential Random Variables COLT 2013
Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights COLT 2013
Fast Template Evaluation with Vector Quantization NIPS 2013
Wavelets on Graphs via Deep Learning NIPS 2013
Random Grids: Fast Approximate Nearest Neighbors and Range Searching for Image Search ICCV 2013
Fluttering Pattern Generation Using Modified Legendre Sequence for Coded Exposure Imaging ICCV 2013
Prime Object Proposals with Randomized Prim's Algorithm ICCV 2013
What is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? ICCV 2013
Go-ICP: Solving 3D Registration Efficiently and Globally Optimally ICCV 2013
Progressive Multigrid Eigensolvers for Multiscale Spectral Segmentation ICCV 2013
Partial Enumeration and Curvature Regularization ICCV 2013
Toward Guaranteed Illumination Models for Non-convex Objects ICCV 2013
SIFTpack: A Compact Representation for Efficient SIFT Matching ICCV 2013
Elastic Net Constraints for Shape Matching ICCV 2013
Joint Optimization for Consistent Multiple Graph Matching ICCV 2013
Real-Time Solution to the Absolute Pose Problem with Unknown Radial Distortion and Focal Length ICCV 2013
Which Space Partitioning Tree to Use for Search? NIPS 2013
Unsupervised Spectral Learning of Finite State Transducers NIPS 2013
Multiclass Total Variation Clustering NIPS 2013
Long-Term Occupancy Analysis Using Graph-Based Optimisation in Thermal Imagery CVPR 2013
Efficient Computation of Shortest Path-Concavity for 3D Meshes CVPR 2013
Reconstructing Loopy Curvilinear Structures Using Integer Programming CVPR 2013
A Practical Rank-Constrained Eight-Point Algorithm for Fundamental Matrix Estimation CVPR 2013
Robust Estimation of Nonrigid Transformation for Point Set Registration CVPR 2013
Learning Functions of Halfspaces Using Prefix Covers COLT 2012