193 search results - page 19 / 39 » Exponential lower bounds for the numbers of Skolem-type sequ... |
ISSAC
1997
Springer
13 years 11 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
BMCBI
2005
13 years 7 months ago
2005
Background: With the exponential increase in genomic sequence data there is a need to develop automated approaches to deducing the biological functions of novel sequences with hig...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
DAGSTUHL
2006
13 years 8 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
KDD
2002
ACM
14 years 7 months ago
2002
ACM
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...