6045 search results - page 301 / 1209 » Computable Linearizations of Well-partial-orderings |
182
click to vote
COMBINATORICS
2007
15 years 7 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
176
click to vote
DLT
2008
15 years 8 months ago
2008
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
173
click to vote
NIPS
2003
15 years 8 months ago
2003
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
108
click to vote
IJBC
2007
15 years 7 months ago
2007
In this tutorial, we present optimal Cellular Nonlinear Network (CNN) templates for implementing linearly-separable one-dimensional (1-D) Cellular Automata (CA). From the gallery ...
217
click to vote
AUTOMATICA
2002
15 years 7 months ago
2002
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...