1396 search results - page 6 / 280 » Succinct Dynamic Data Structures |
STACS
2009
Springer
14 years 3 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
13 years 3 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...
CPM
2004
Springer
14 years 1 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
IJFCS
2006
13 years 8 months ago
2006
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...
KDD
2012
ACM
11 years 11 months ago
2012
ACM
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...