Using Hardcoded Hedge-Automata for Compressing Structured Documents
Aditya Nori, Priti Shankar and Helmut Seidl
IISc-CSA-TR-2002-1
(July 2002) Available formats: [ps] [ps.gz]
Filed on June 25, 2004
Updated on June 26, 2004
We propose a scheme for compressing tree structured data which uses a
hardcoded pushdown hedge automata. Our algorithm is a lossless adaptive
algorithm where the hardcoded model is used in conjunction with an
arithmetic compressor to produce a compressed version of the tree. The
structure of the model mirrors the syntactic specification of the tree
structure. A quantitative analysis of the advantages that accrue from such
a model is provided.
Please bookmark this technical report as http://aditya.csa.iisc.ernet.in/TR/2002/1/.Problems ? Contact techrep@csa.iisc.ernet.in
[Updated at 2009-10-22T06:42Z]