105 search results - page 4 / 21 » Tree Structure Compression with RePair |
JMIV
2002
14 years 9 months ago
2002
In our recent work, a class of parametric transforms, including family of Haar-like transforms, was introduced and studied in application to image compression. Parametric Haar-lik...
ICIP
1999
IEEE
15 years 1 months ago
1999
IEEE
We consider the use of a static context tree for binary image compression. The contexts are stored in the leaves of a variable-depth binary tree. The tree structure itself is full...
CPM
1999
Springer
15 years 1 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
DAGSTUHL
1996
14 years 10 months ago
1996
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
TCBB
2010
2010
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
14 years 4 months ago
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...