105 search results - page 7 / 21 » Tree Structure Compression with RePair |
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
IPL
2010
14 years 7 months ago
2010
We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the su...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
SPIESR
1993
14 years 10 months ago
1993
Autosophy, an emerging new science, explains "Self-assembling Structures", such crystals or living trees, in mathematical terms. This research provides a new mathematica...