Dimensionality Reduction for Similarity Searching in Dynamic Databases
- 31 July 1999
- journal article
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 75 (1-2) , 59-72
- https://doi.org/10.1006/cviu.1999.0762
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Visual information retrievalCommunications of the ACM, 1997
- Finding Images/Video in Large ArchivesD-Lib Magazine, 1997
- A general solution of the n-dimensional B-tree problemPublished by Association for Computing Machinery (ACM) ,1995
- Efficient and effective Querying by Image ContentJournal of Intelligent Information Systems, 1994
- Fast subsequence matching in time-series databasesPublished by Association for Computing Machinery (ACM) ,1994
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990
- Efficient, numerically stabilized rank-one eigenstructure updating (signal processing)IEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
- The BANG file: A new kind of grid filePublished by Association for Computing Machinery (ACM) ,1987
- 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