Searching for "Access Method, High-Dimensional." – sorted by Relevance.
-
Image indexing andrd*(B-%% usingsignatur trna Mar* A. Nascimento
- and CCVs, since SR-trees are arguably the most efficient access method for high-dimensional points. Our
- Add To MetaCart
-
Indexing Regional Objects in High-Dimensional Spaces
- access methods that effectively attack these problems. It also discusses the importance of high-dimensional
- Add To MetaCart
-
On Two Principles of Designing Multi-Dimensional Access Methods
- . In this paper, we approach the design of access methods for data in high-dimensional feature spaces in a
- Add To MetaCart
-
A Class of Region-Preserving Space Transformations for Indexing High-Dimensional Data
- ) schemes for accessing high-dimensional data. The access methods in this class differ with respect
- Add To MetaCart
-
Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces
- and Yu, 2000). Few access methods for high-dimensional data can accommodate extended regional objects. X
- Cited by 4 (4 self) – Add To MetaCart
-
D*: A Data Storage and Retrieval System for Scientific Studies
- that are not particularly useful for the design of access methods for data in high-dimensional spaces. In fact, a vast
- Add To MetaCart
-
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
- (≥ around 6.) To sum up, among access methods for high-dimensional vector space search, the SR
- Cited by 76 (0 self) – Add To MetaCart

