Sciweavers

1381 search results - page 78 / 277
» Structural signatures for tree data structures
Sort
View
DASFAA
2005
IEEE
133views Database» more  DASFAA 2005»
15 years 3 months ago
Mining Frequent Tree-Like Patterns in Large Datasets
In this paper, we propose a novel data mining scheme to explore the frequent hierarchical structure patterns, named tree-like patterns, with the relationship of each item on a sequ...
Tzung-Shi Chen, Shih-Chun Hsu
EUROPAR
2003
Springer
15 years 3 months ago
Parallelization with Tree Skeletons
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
DCC
1998
IEEE
15 years 2 months ago
The Context Trees of Block Sorting Compression
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...
N. Jesper Larsson
SAS
1999
Springer
15 years 2 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
ICIP
2001
IEEE
15 years 11 months ago
Color image coding, indexing and retrieval using binary space partitioning tree
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
Guoping Qiu, S. Sudirman