Deflating the dimensionality curse using multiple fractal dimensions
- 7 November 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Lower bounds for high dimensional nearest neighbor search and related problemsPublished by Association for Computing Machinery (ACM) ,1999
- Multidimensional access methodsACM Computing Surveys, 1998
- A cost model for similarity queries in metric spacesPublished by Association for Computing Machinery (ACM) ,1998
- On the analysis of indexing schemesPublished by Association for Computing Machinery (ACM) ,1997
- A model for the prediction of R-tree performancePublished by Association for Computing Machinery (ACM) ,1996
- Beyond uniformity and independencePublished by Association for Computing Machinery (ACM) ,1994
- Efficient similarity search in sequence databasesLecture Notes in Computer Science, 1993
- New techniques for best-match retrievalACM Transactions on Information Systems, 1990
- Implications of certain assumptions in database performance evauationACM Transactions on Database Systems, 1984
- R-treesPublished by Association for Computing Machinery (ACM) ,1984