We propose multi-dimensional index data structures that generalize su x arrays to square matrices and cubic matrices. Giancarlo proposed a two-dimensional index data structure, the Lsu x tree, that generalizes su x trees to square matrices. However, the construction algorithm for Lsu x trees maintai
Generalizations of suffix arrays to multi-dimensional matrices
β Scribed by Dong Kyue Kim; Yoo Ah Kim; Kunsoo Park
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 278 KB
- Volume
- 302
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Multipartitioning is a strategy for decomposing multi-dimensional arrays into tiles and mapping the resulting tiles onto a collection of processors. This class of partitionings enables efficient parallelization of ''line-sweep'' computations that solve onedimensional recurrences along each dimension
In this paper, we provide two generalizations of the CUR matrix decomposition Y = CUR (also known as pseudo-skeleton approximation method [1]) to the case of N-way arrays (tensors). These generalizations, which we called Fiber Sampling Tensor Decomposition types 1 and 2 (FSTD1 and FSTD2), provide ex