181 search results - page 8 / 37 » On Quantification with A Finite Universe |
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— The present paper is devoted to the exploration of the properties of the simple spiking neuron model and quantification of the information transfer rate, which the separate neu...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
COLING
2008
13 years 9 months ago
2008
Finite-state Transducers (FST) can be very efficient to implement inter-dialectal transliteration. We illustrate this on the Hindi and Urdu language pair. FSTs can also be used fo...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
EUROCAST
1997
Springer
13 years 12 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...