178 search results - page 24 / 36 » combinatorics 2007 |
152
click to vote
CPM
2007
Springer
15 years 10 months ago
2007
Springer
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
151
click to vote
CPM
2007
Springer
15 years 10 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
132
click to vote
EJC
2008
15 years 6 months ago
2008
Let denote a distance-regular graph with classical parameters (D, b, , ) and D 3. Assume the intersection numbers a1 = 0 and a2 = 0. We show is 3-bounded in the sense of the ar...
126
click to vote
COCOON
2007
Springer
16 years 3 days ago
2007
Springer
We provide three key missing pieces of a general theory of information distance [3, 23, 24]. We take bold steps in formulating a revised theory to avoid some pitfalls in practical...
117
Voted
ITA
2007
15 years 5 months ago
2007
: For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate f...