Co-occurring keywords · papers mentioning both
Papers
Hash Bit Selection: A Unified Solution for Selection Problems in Hashing
CVPR 2013
Learning Hash Codes with Listwise Supervision
ICCV 2013
Learning Hash Functions Using Column Generation
ICML 2013
Learning to Prune in Metric and Non-Metric Spaces
NeurIPS 2013
Optimized Product Quantization for Approximate Nearest Neighbor Search
CVPR 2013
Randomized partition trees for exact nearest neighbor search
COLT 2013
Rapid Distance-Based Outlier Detection via Sampling
NeurIPS 2013
SIFTpack: A Compact Representation for Efficient SIFT Matching
ICCV 2013
That was fast! Speeding up NN search of high dimensional distributions.
ICML 2013
Which Space Partitioning Tree to Use for Search?
NeurIPS 2013
Hamming Distance Metric Learning
NeurIPS 2012
Isotropic Hashing
NeurIPS 2012
Scalable Inference on Kingman’s Coalescent using Pair Similarity
AISTATS 2012
Convergent Bounds on the Euclidean Distance
NeurIPS 2011
Exploiting spatial overlap to efficiently compute appearance distances between image windows
NeurIPS 2011
Learning to Search Efficiently in High Dimensions
NeurIPS 2011
Nearest Neighbor based Greedy Coordinate Descent
NeurIPS 2011
Randomized Algorithms for Comparison-based Search
NeurIPS 2011
Hashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning
NeurIPS 2010
Efficient Bregman Range Search
NeurIPS 2009
Learning to Hash with Binary Reconstructive Embeddings
NeurIPS 2009
Linear-time Algorithms for Pairwise Statistical Problems
NeurIPS 2009
Locality-sensitive binary codes from shift-invariant kernels
NeurIPS 2009
Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions
NeurIPS 2009
Predictive Indexing for Fast Search
NeurIPS 2008