33 search results - page 1 / 7 » Statistical Encoding of Succinct Data Structures |
67
Voted
CPM
2006
Springer
15 years 1 months ago
2006
Springer
108
click to vote
CPM
2005
Springer
15 years 3 months ago
2005
Springer
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
76
Voted
DEXAW
2008
IEEE
15 years 4 months ago
2008
IEEE
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...