3913 search results - page 56 / 783 » complexity 2006 |
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
IEEEARES
2006
IEEE
14 years 1 months ago
2006
IEEE
—Today’s business climate requires you to constantly evolve IT strategies responding to new opportunities or threats. While the fundamentals of IT - reliability, availability, ...
AAIM
2006
Springer
14 years 1 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
DAGSTUHL
2006
13 years 9 months ago
2006
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true dis...