Sciweavers

6 search results - page 1 / 2
» Finite-State Computation in Analog Neural Networks: Steps to...
Sort
View
NEUROSCIENCE
2001
Springer
13 years 9 months ago
Finite-State Computation in Analog Neural Networks: Steps towards Biologically Plausible Models?
Abstract. Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, a...
Mikel L. Forcada, Rafael C. Carrasco
IWANN
2005
Springer
13 years 10 months ago
Characterizing Self-developing Biological Neural Networks: A First Step Towards Their Application to Computing Systems
Carbon nanotubes are often seen as the only alternative technology to silicon transistors. While they are the most likely short-term alternative, other longer-term alternatives sho...
Hugues Berry, Olivier Temam
ECCV
2004
Springer
14 years 6 months ago
A Biologically Motivated and Computationally Tractable Model of Low and Mid-Level Vision Tasks
This paper presents a biologically motivated model for low and mid-level vision tasks and its interpretation in computer vision terms. Initially we briefly present the biologically...
Iasonas Kokkinos, Rachid Deriche, Petros Maragos, ...
ICANN
1997
Springer
13 years 8 months ago
Real-Time Analog VLSI Sensors for 2-D Direction of Motion
Optical ow elds are a primary source of information about the visual scene in technical and biological systems. In a step towards a system for real time scene analysis we have deve...
Rainer A. Deutschmann, Charles M. Higgins, Christo...
NEUROSCIENCE
2001
Springer
13 years 9 months ago
Biological Grounding of Recruitment Learning and Vicinal Algorithms in Long-Term Potentiation
Biological networks are capable of gradual learning based on observing a large number of exemplars over time as well as of rapidly memorizing specific events as a result of a sin...
Lokendra Shastri