Dimensionality reduction for similarity searching in dynamic databases
- 1 June 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 27 (2), 166-176
- https://doi.org/10.1145/276304.276320
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- An Eigenspace Update Algorithm for Image AnalysisGraphical Models and Image Processing, 1997
- Adaptive estimation of eigensubspaceIEEE Transactions on Signal Processing, 1995
- Fast subsequence matching in time-series databasesPublished by Association for Computing Machinery (ACM) ,1994
- QBIC project: querying images by content, using color, texture, and shapePublished by SPIE-Intl Soc Optical Eng ,1993
- The hB-tree: a multiattribute indexing method with good guaranteed performanceACM Transactions on Database Systems, 1990
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990
- The BANG file: A new kind of grid filePublished by Association for Computing Machinery (ACM) ,1987
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975