140 search results - page 9 / 28 » String Quartets In Binary |
LATA
2009
Springer
14 years 2 months ago
2009
Springer
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
CAIP
2005
Springer
14 years 1 months ago
2005
Springer
A method dealing with recognition of partially occluded and affine transformed binary objects is presented. The method is designed for objects with smooth curved boundary. It divi...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
IPL
2008
13 years 7 months ago
2008
In order to generate a universal probability distribution to extrapolate a binary string x of length i, we feed random bits into a universal device, M. When we find an input strin...