参考文献A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximatenearest neighbor in high dimensions. Comm. of the ACM, vol.51, no. 1, pp.117-122, 2008.A. Broder. On the resemblance and containment of documents. SEQUENCES,1997.M. Charikar. Similarity estimation techniques from rounding. STOC, 2002.P. Indyk, R. Motwani. Approximate nearest neighbor: towards removing thecurse of dimensionality. STOC, 1998.B. Kullis and K. Grauman. Kernelized locality-sensitive hashing for scalableimage search. ICCV, 2009.P. Li and A. C. König. b-Bit minwise hashing. WWW, 2010.P. Li and A. Shrivastava. Hashing algorithms for large-scale learning. NIPS,2011.W. Liu, J. Wang, S. Kumar and S.-F. Chang. Hashing with graphs. ICML, 2011.K. Weinberger, A. Dasgupta, J. Langford, A. Smola and J. Attenberg. Featurehashing for large scale multitask learning. ICML, 2009.Y. Weiss, A. Torralba and R. Fergus. Spectral hashing. NIPS, 2008.D. Zhang, J. Wang, D. Cai and J. Lu. Self-taught hashing for fast similaritysearch. SIGIR, 2010.
A particular slide catching your eye?
Clipping is a handy way to collect important slides you want to go back to later.