Fetching the paper…
Reading the bibliography…
Emerging location-based systems and data analysis frameworks requires efficient management of spatial data for approximate and exact search.
On the distribution of points in a cube and the approximate evaluation of integrals. USSR Computational Mathematics and Mathematical Physics 7(4), 86 – 112 (1967)
1967
Earlier work this paper cites.
Finkel, R.A., Bentley, J.L.: Quad trees a data structure for retrieval on composite keys. Acta Informatica 4(1), 1–9 (1974)
1974
Earlier work this paper cites.
Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM 18(9), 509–517 (1975)
1975
Earlier work this paper cites.
Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3(3), 209–226 (1977)
1977
Earlier work this paper cites.
Guttman, A.: R-trees: a dynamic index structure for spatial searching, vol. 14. ACM (1984)
1984
Earlier work this paper cites.
Tamminen, M., Samet, H.: Efficient octree conversion by connectivity labeling. SIGGRAPH Comput. Graph. 18(3) (1984)
1984
Earlier work this paper cites.
Niederreiter, H.: Low-discrepancy and low-dispersion sequences. Journal of Number Theory 30(1), 51 – 70 (1988)
1988
Earlier work this paper cites.
Omohundro, S.M.: Five balltree construction algorithms. Tech. rep., ICSI Berkeley (1989)
1989
Earlier work this paper cites.
Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The r*-tree: An efficient and robust access method for points and rectangles. SIGMOD Rec. 19(2), 322–331 (May 1990)
1990
Earlier work this paper cites.
Uhlmann, J.K.: Metric trees. Applied Mathematics Letters 4(5), 61–62 (1991)
1991
Earlier work this paper cites.
Micó, M.L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. Pattern Recognition Letters 15(1), 9–17 (1994)
1994
Earlier work this paper cites.
Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB (1997)
1997
Earlier work this paper cites.
Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM computing surveys 33(3), 273–321 (2001)
2001
Earlier work this paper cites.
Borodin, A., Ostrovsky, R., Rabani, Y.: Lower bounds for high dimensional nearest neighbor search and related problems. In: Discrete and Computational Geometry, pp. 253–274. Springer (2003)
2003
Cited alongside, same era.
Liu, T., Moore, A.W., Gray, A.G.: Efficient exact k-nn and nonparametric classification in high dimensions. In: Advances in Neural Information Processing Systems. p. None (2003)
2003
Cited alongside, same era.
Duin, R.P.W., Juszczak, P., de Ridder, D., Paclik, P., Pekalska, E., Tax, D.M.: Prtools, a matlab toolbox for pattern recognition (2004), http://www.prtools.org
2004
Cited alongside, same era.
Liu, T., Moore, A.W., Yang, K., Gray, A.G.: An investigation of practical approximate nearest neighbor algorithms. In: Advances in neural information processing systems. pp. 825–832 (2004)
2004
Cited alongside, same era.
van der Maaten, L.J., Postma, E.O., van den Herik, H.J.: Dimensionality reduction: A comparative review. JMLR 10(1-41), 66–71 (2009)
2009
Later among the works it cites.
Abdi, H., Williams, L.J.: Principal component analysis. Computational Statistics 2(4), 433–459 (2010)
2010
Later among the works it cites.
Bhatia, N., et al.: Survey of nearest neighbor techniques. arXiv preprint arXiv:1007.0085 (2010)
2010
Later among the works it cites.
Danilewski, P., Popov, S., Slusallek, P.: Binned SAH KD-Tree construction on a GPU. Tech. rep., Saarland U. (jun 2010)
2010
Later among the works it cites.
Bertin-Mahieux, T., Ellis, D.P., Whitman, B., Lamere, P.: The million song dataset. In: ISMIR (2011)
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2005
Cited alongside, same era.
Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs, 2nd Ed. Chapman & Hall/CRC (2006)
2006
Cited alongside, same era.
Leibe, B., Mikolajczyk, K., Schiele, B.: Efficient clustering and matching for object class recognition. In: British Machine Vision Conference. pp. 789–798 (2006)
2006
Cited alongside, same era.
Liu, T., Moore, A.W., Gray, A.: New algorithms for efficient high-dimensional nonparametric classification. JMLR 7, 1135–1158 (2006)
2006
Cited alongside, same era.
Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity search: the metric space approach, vol. 32. Springer Science & Business Media (2006)
2006
Cited alongside, same era.
Kibriya, A.M., Frank, E.: An empirical comparison of exact nearest neighbour algorithms. In: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases. pp. 140–151. Springer-Verlag (2007)
2007
Cited alongside, same era.
Kumar, N., Zhang, L., Nayar, S.: What is a good nearest neighbors algorithm for finding similar patches in images? In: Proceedings of the 10th European Conference on Computer Vision: Part II. ECCV (2008)
2008
Cited alongside, same era.
Zhou, K., Hou, Q., Wang, R., Guo, B.: Real-time KD-Tree construction on graphics hardware. ACM TOG 27(5), 126 (2008)
2008
Cited alongside, same era.
Munaga, H., Jarugumalli, V.: Performance evaluation: Ball-Tree and KD-Tree in the context of MST. In: Signal Processing and Information Technology, pp. 225–228. Springer (2012)
2012
Later among the works it cites.
Kaul, M., Yang, B., Jensen, C.: Building accurate 3d spatial networks to enable next generation intelligent transportation systems. In: Mobile Data Management (MDM), 2013 IEEE 14th International Conference on. vol. 1, pp. 137–146 (June 2013)
2013
Later among the works it cites.
Lichman, M.: UCI machine learning repository (2013), http://archive.ics.uci.edu/ml
2013
Later among the works it cites.
Tellez, E.S., Chávez, E., Navarro, G.: Succinct nearest neighbor search. Information Systems 38(7), 1019–1030 (2013)
2013
Later among the works it cites.
Amato, G., Falchi, F., Rabitti, F., Vadicamo, L.: Some theoretical and experimental observations on permutation spaces and similarity search. In: Similarity Search and Applications, pp. 37–49. Springer (2014)
2014
Later among the works it cites.
Zhou, M.: Build and travel KD-Tree with CUDA. Tech. rep., Carleton University (2014)
2014
Later among the works it cites.
Naidan, B., Boytsov, L., Nyberg, E.: Permutation search methods are efficient, yet faster search is possible. PVLDB 8(12), 1618–1629 (2015)
2015
Closest in time.