Advanced Search
Now showing items 1-10 of 11
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
(ELSEVIER SCIENCE BV, 2005-11-30)
)
nodes overall, in the worst case. For simplicity, we describe our algorithms on a sistring
trie, although they run with the same complexity over sistring trees.
We finish with folklore property of the sistring trie that is important for some analyses...
Practical compressed string dictionaries
(Elsevier, 2016)
are called
instantaneous. To be instantaneous, it is necessary and
sufficient that the code is a prefix code, that is, no code is asmaller numbers. Variable byte (Vbyte) coding [78] is a
folklore byte-oriented technique used in information
retrieval...
an integral number of symbols in C (the sequence of terminals and nonterminals into which T dict is compressed). To do so, we add unique separators after each terminator $, to prevent Re-Pair from forming Hashing [23] is a folklore method to store a dictionary...
an integral number of symbols in C (the sequence of terminals and nonterminals into which T dict is compressed). To do so, we add unique separators after each terminator $, to prevent Re-Pair from forming Hashing [23] is a folklore method to store a dictionary...
Universal compressed text indexing
(Elsevier, 2019)
∈ �(nc+2) for an arbitrarily large constant c, one obtains that such a
sh function is collision-free among all equal-length substrings of a given string S of length n w.h.p. To conclude, we will
ploit the (easily provable) folklore fact that two...
DACs: Bringing direct access to variable-length codes
(2013)
is ubiquitous in many sorts of appli-
cations, particularly in compressed data structures, but also arises in everyday programming. Using bitmaps aligned to the
codes in order to mark their beginnings is a folklore idea that has been used many times (Fano, 1971...
Simple and efficient fully-functional succinct trees
(Elsevier, 2016-12-20)
tree T ′ of Section 3.1 is built
ing a stack-based folklore algorithm that finds the previous-smaller-value of each element in array m[] in linear time and
ace (that is, O(n/β) words). The ladder decomposition and pointers to ancestors at distances 2k...
Efficient Fully-Compressed Sequence Representations
(Springer, 2012)
-time decoding, is indeed the reason why
it is used in practice in various folklore applications, as mentioned in the Introduction.
In Sect. 8.2 we experimentally evaluate these ideas and show they are practical. Next,
we give more far-fetched applications...
Grammar compressed sequences with rank/select support
(Elsevier, 2017)
in O (logn) time. This folklore idea, which we call DELTA, has been used repeatedly; see e.g. [33].
5. Grammar-compressed bitmaps
The only bitmap representation we are aware of that exploits repetitiveness in the bitmaps is due to Navarro et al. [47]
PB...
Aggregated 2D range queries on clustered points
(Pergamon-Elsevier Science, 2016)
sequence of values smaller than the original, but which
may contain negative values. In order to map this sequ-
ence, in a unique and reversible way, to a sequence of non-
negative values we use the folklore overlap and interleave
Fig. 7. Storage...
Word-Based Self-Indexes for Natural Language Text
(ASSOC COMPUTING MACHINERY, 2012-02)
, about half a million are negative
values. Albeit not a very large percentage, encoding those values improperly does impact
compression ratios.
When using δ–codes, negative values must be encoded somehow as exceptions. We also
consider another folklore...
Compact representation of Webgraphs with extended functionality
(Elsevier, 2013)