Author:
Uribe-Paredes Roberto,Valero-Lara Pedro,Arias Enrique,Sánchez José L.,Cazorla Diego
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM Computing Surveys 33(3), 273–321 (2001)
2. Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering 9(5) (1983)
3. Uhlmann, J.: Satisfying general proximity/similarity queries with metric trees. Information Processing Letters 40, 175–179 (1991)
4. Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: The 23st International Conference on VLDB, pp. 426–435 (1997)
5. Brin, S.: Near neighbor search in large metric spaces. In: The 21st VLDB Conference, pp. 574–584. Morgan Kaufmann Publishers, San Francisco (1995)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献