429 search results - page 26 / 86 » Turing computations on ordinals |
EUROCAST
1997
Springer
15 years 4 months ago
1997
Springer
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...
111
click to vote
UPP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This is just a glimpse to the fruitful and constant preoccupation of computer science to try to get inspired by biology, at various levels. Besides briefly discussing th...
MLQ
2007
14 years 11 months ago
2007
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
CVPR
2005
IEEE
15 years 5 months ago
2005
IEEE
Palmprint-based personal identification, as a new member in the biometrics family, has become an active research topic in recent years. Although great progress has been made, how ...
102
click to vote
CVPR
1997
IEEE
15 years 4 months ago
1997
IEEE
Wepresent a methodfor motion estimation using ordinal measures. Ordinal measures are based on relative ordering of intensity values in a image regioncalled rankpermutation. While ...