暂无分享,去创建一个
[1] Marvin Minsky,et al. Perceptrons: An Introduction to Computational Geometry , 1969 .
[2] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[3] Nicole Immorlica,et al. Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.
[4] Robert Krauthgamer,et al. Navigating nets: simple algorithms for proximity search , 2004, SODA '04.
[5] Michael T. Orchard,et al. A fast nearest-neighbor search algorithm , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.
[6] Laurent Amsaleg,et al. Locality sensitive hashing: A comparison of hash function types and querying mechanisms , 2010, Pattern Recognit. Lett..
[7] Yoshua Bengio,et al. Gradient-based learning applied to document recognition , 1998, Proc. IEEE.
[8] Alexandr Andoni,et al. Optimal Data-Dependent Hashing for Approximate Near Neighbors , 2015, STOC.
[9] S. Meiser,et al. Point Location in Arrangements of Hyperplanes , 1993, Inf. Comput..
[10] Hans-Peter Kriegel,et al. Fast nearest neighbor search in high-dimensional space , 1998, Proceedings 14th International Conference on Data Engineering.
[11] Cordelia Schmid,et al. Product Quantization for Nearest Neighbor Search , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[12] Andrew D. Smith,et al. A Geometric Interpretation for Local Alignment-Free Sequence Comparison , 2013, J. Comput. Biol..
[13] Ahmed Eldawy,et al. SpatialHadoop: A MapReduce framework for spatial data , 2015, 2015 IEEE 31st International Conference on Data Engineering.
[14] L. Devroye,et al. A weighted k-nearest neighbor density estimate for geometric inference , 2011 .
[15] Ioannis Z. Emiris,et al. Low-quality dimension reduction and high-dimensional Approximate Nearest Neighbor , 2015, Symposium on Computational Geometry.
[16] Alexandr Andoni,et al. Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[17] Hans-Peter Kriegel,et al. The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.
[18] Leonidas J. Guibas,et al. A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[19] Sanjoy Dasgupta,et al. Randomized Partition Trees for Nearest Neighbor Search , 2014, Algorithmica.
[20] John Langford,et al. Cover trees for nearest neighbor , 2006, ICML.
[21] Kenneth L. Clarkson,et al. Nearest Neighbor Queries in Metric Spaces , 1997, STOC '97.
[22] Michael E. Houle,et al. Rank-Based Similarity Search: Reducing the Dimensional Dependence , 2015, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[23] Alex Krizhevsky,et al. Learning Multiple Layers of Features from Tiny Images , 2009 .
[24] David R. Karger,et al. Finding nearest neighbors in growth-restricted metrics , 2002, STOC '02.
[25] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[26] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[27] William Pugh,et al. Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.
[28] Rudolf Bayer,et al. Symmetric binary B-Trees: Data structure and maintenance algorithms , 1972, Acta Informatica.
[29] Andrew W. Moore,et al. An Investigation of Practical Approximate Nearest Neighbor Algorithms , 2004, NIPS.
[30] Antonio Torralba,et al. Spectral Hashing , 2008, NIPS.
[31] Sanjoy Dasgupta,et al. Random projection trees and low dimensional manifolds , 2008, STOC.
[32] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.
[33] Sunil Arya,et al. Approximate nearest neighbor queries in fixed dimensions , 1993, SODA '93.
[34] Jitendra Malik,et al. Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing , 2015, ICML.