168 search results - page 13 / 34 » An Upper Bound for B2[2] Sequences |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total...
VTC
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract: The peak factor of a continuous digitallymodulated signal is often analyzed from its samples taken at the Nyquist rate. This, however, may involve a significant error. It...
RSA
2011
13 years 2 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
ICDE
1995
IEEE
14 years 9 months ago
1995
IEEE
We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we...