Sciweavers

178 search results - page 24 / 36
» combinatorics 2007
Sort
View
CPM
2007
Springer
73views Combinatorics» more  CPM 2007»
14 years 2 months ago
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
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...
Travis Gagie, Giovanni Manzini
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
14 years 2 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
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...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
EJC
2008
13 years 11 months ago
3-bounded property in a triangle-free distance-regular graph
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...
Yeh-jong Pan, Chih-wen Weng
COCOON
2007
Springer
14 years 5 months ago
Information Distance from a Question to an Answer
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...
Ming Li
ITA
2007
13 years 10 months ago
An algorithm for deciding if a polyomino tiles the plane
: 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...
Ian Gambini, Laurent Vuillon