675 search results - page 86 / 135 » On Compression of Parse Trees |
DCC
2010
IEEE
14 years 3 months ago
2010
IEEE
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
In this paper, we investigate region-based embedded wavelet compression methods and introduce region-based extensions of the Set Partitioning In Hierarchical Trees (SPIHT) and the...
SPIRE
2009
Springer
14 years 3 months ago
2009
Springer
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
IPL
2010
13 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...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...