Counting distance permutations

Proceedings - First International Workshop on Similarity Search and Applications, SISAP 2008

Volumn , Issue , 2008, Pages 69-76

  Skala, Matthew ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE PERMUTATIONS; DOCUMENT SPACES;

DATABASE SYSTEMS; INFORMATION DISSEMINATION; NUMERICAL METHODS; VECTORS; WEB SERVICES; WEBSITES;

ONLINE SEARCHING;

EID: 44249124055     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SISAP.2008.15     Document Type: Conference Paper

References (21)

1. F. Aurenhammer. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Computing Surveys, Sept 1991, 23(3), 1991.
2. Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In 37th Annual Symposium on Foundations of Computer Science (FOCS'96), pages 184-193. IEEE, 1996.
3. A. Björner, M. Las Vergnas, B. Sturmfels, N. White, and G. M. Ziegler. Oriented Matroids. Cambridge University Press, second edition, 1999.
4. E. Chávez, K. Figueroa, and G. Navarro. Proximity searching in high dimensional spaces with a proximity preserving order. In A. Gelbukh, Á. de Albornoz, and H. Terashima-Marín, editors, 4th Mexican International Conference on Artificial Intelligence (MICAI'05), pages 405-414. Springer, 2005.
5. E. Chávez and G. Navarro. Measuring the dimensionality of general metric spaces. Technical Report TR/DCC-00-1, Department of Computer Science, University of Chile, 2000.
6. K. Figueroa, E. Chávez, G. Navarro, and R. Paredes. On the least cost for proximity searching in metric spaces. In C. Alvarez and M. Serna, editors, Experimental and Efficient Algorithms: 5th International Workshop (WEA'06), pages 279-290. Springer, 2006.
7. K. Figueroa, G. Navarro, and E. Chávez. Metric Spaces Library. Online http://www.sisap.org/?f=library. Accessed November 24, 2007.
8. B. Grünbaum. Arrangements and Spreads. Number 10 in Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics. American Mathematical. Society, Providence, June 1971.
9. C. Icking, R. Klein, N.-M. Lê, and L. Ma. Convex distance functions in 3-space are different. Fundamenta Informaticae, 22(4):331-352, 1995.
10. C. Icking, R. Klein, N.-M. Lê, L. Ma, and F. Santos. On bisectors for convex distance functions in 3-space. In 11th Canadian Conference on Computational Geometry (CCCG'99), pages 119-123. University of British Columbia, 1999.
11. D. G. Lowe. Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision, 60(2):91-110, Nov. 2004.
12. A. Mandel. Topology of Oriented Matroids. PhD thesis, University of Waterloo, 1982.
13. L. Micó, J. Oncina, and E. Vidal. 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.
14. R. Paredes and E. Chávez. Using the k;-nearest neighbor graph for proximity searching in metric spaces. In M. P. Consens and G. Navarro, editors, String Processing and Information Retrieval, 12th International Conference (SPIRE'05), pages 127-138. Springer, 2005.
15. D. J. Price. Some unusual series occurring in n-dimensional geometry. The Mathematical Gazette, 30:149-150, 1946.
16. E.V.Ruiz. An algorithm for finding nearest neighbors in (approximately) constant time. Pattern Recognition Letters, 4:145-157, 1986.
17. M. Sahlgren. The Word-Space Model. PhD thesis, Stockholm University, 2006. Online http://www.sics.se/~mange/TheWordSpaceModel.pdf.
18. F. Santos. On Delaunay oriented matroids for convex distance functions. Discrete & Computational Geometry, 16(2):197-210, 1996.
19. M. Skala. Measuring the difficulty of distance-based indexing. In M. P. Consens and G. Navarro, editors, String Processing and Information Retrieval: 12th International Conference (SPIRE'05), pages 103-114. Springer, 2005.
20. J. K. Uhlmann. Satisfying general proximity/similarity queries with, metric trees. Information Processing Letters, 40:175-179, Nov. 25, 1991.
21. P. N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms (SODA'93), pages 311-321. ACM/SIAM, 1993.