140 search results - page 7 / 28 » Practical Suffix Tree Construction |
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
BIRD
2007
Springer
14 years 2 months ago
2007
Springer
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...
DCC
1998
IEEE
14 years 9 days ago
1998
IEEE
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
ISMIS
1997
Springer
14 years 5 days ago
1997
Springer
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
ISPD
2000
ACM
14 years 12 days ago
2000
ACM
In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such ...