312 search results - page 13 / 63 » Indexing Gapped-Factors Using a Tree |
DAM
1998
13 years 9 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...
ICDE
2003
IEEE
14 years 11 months ago
2003
IEEE
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
IADIS
2003
13 years 11 months ago
2003
This article proposes an approach to the generation of guided tours over indexed information resources on user demand. It represents an alternative to more sophisticated hyperdocu...
CCP
2011
12 years 9 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
VLDB
1999
ACM
14 years 2 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...