LSH banding for large-scale retrieval with memory and recall constraints
暂无分享,去创建一个
[1] Shumeet Baluja,et al. Learning to hash: forgiving hash functions and applications , 2008, Data Mining and Knowledge Discovery.
[2] Andrew W. Moore,et al. An Investigation of Practical Approximate Nearest Neighbor Algorithms , 2004, NIPS.
[3] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[4] Shumeet Baluja,et al. Waveprint: Efficient wavelet-based audio fingerprinting , 2008, Pattern Recognit..
[5] Antonio Torralba,et al. Ieee Transactions on Pattern Analysis and Machine Intelligence 1 80 Million Tiny Images: a Large Dataset for Non-parametric Object and Scene Recognition , 2022 .
[6] Maxim Sviridenko,et al. A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..
[7] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[8] Sergey Ioffe,et al. Permutation grouping: intelligent Hash function design for audio & image retrieval , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.