1. 1. V. Athitsos, J. Alon, S. Sclaroff, and G. Kollios, “BoostMap: A method for efficient approximate similarity rankings,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2004, vol. 2, pp. II-268–II- 275.
   2. V. Athitsos, M. Hadjieleftheriou, G. Kollios, and S. Sclaroff, “Query-sensitive embeddings,” ACM Trans. Database Syst., vol. 32, no. 2, p. 8, 2007.
   3. C. Bohm, S. Berchtold, and D. A. Keim, “Searching in high-dimen- € sional spaces: Index structures for improving the performance of multimedia databases,” ACM Comput. Surv., vol. 33, no. 3, pp. 322–373, 2001.
   4. L. Boytsov and B. Naidan, “Learning to prune in metric and nonmetric spaces,” in Proc. Adv. Neural Inf. Process. Syst., 2013, pp. 1574–1582.
   5. J. Brandt, “Transform coding for fast approximate nearest neighbor search in high dimensions,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2010, pp. 1815–1822
   6. P. Ciaccia, M. Patella, and P. Zezula, “M-tree: An efficient access method for similarity search in metric spaces,” in Proc. 23rd Int. Conf. Very Large Databases, 1997, pp. 426–435.
   7. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, “Localitysensitive hashing scheme based on p-stable distributions,” in Proc. Symp. Comput. Geometry, 2004, pp. 253–262