Sciweavers

1552 search results - page 305 / 311
» On the Complexity of Constant Propagation
Sort
View
BC
2002
193views more  BC 2002»
14 years 9 months ago
Resonant spatiotemporal learning in large random recurrent networks
Taking a global analogy with the structure of perceptual biological systems, we present a system composed of two layers of real-valued sigmoidal neurons. The primary layer receives...
Emmanuel Daucé, Mathias Quoy, Bernard Doyon
BMCBI
2002
108views more  BMCBI 2002»
14 years 9 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
AML
1998
60views more  AML 1998»
14 years 9 months ago
A restricted computation model on Scott domains and its partial primitive recursive functionals
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
Karl-Heinz Niggl
NN
1998
Springer
201views Neural Networks» more  NN 1998»
14 years 9 months ago
Neural mechanisms of selection and control of visually guided eye movements
The selection and control of action is a critical problem for both biological and machine animated systems that must operate in complex real world situations. Visually guided eye ...
Jeffrey D. Schall, Doug P. Hanes
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
14 years 9 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...