Sciweavers

3406 search results - page 161 / 682
» Computational models of classical conditioning
Sort
View
SIGGRAPH
1993
ACM
15 years 9 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 9 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
146
Voted
BCS
2008
15 years 6 months ago
Dynamic Neighbourhood Cellular Automata
We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of...
Stefan S. Dantchev
IJCNN
2007
IEEE
15 years 11 months ago
Generalised Kernel Machines
Abstract— The generalised linear model (GLM) is the standard approach in classical statistics for regression tasks where it is appropriate to measure the data misfit using a lik...
Gavin C. Cawley, Gareth J. Janacek, Nicola L. C. T...
BMCBI
2010
155views more  BMCBI 2010»
15 years 2 months ago
BrEPS: a flexible and automatic protocol to compute enzyme-specific sequence profiles for functional annotation
Background: Models for the simulation of metabolic networks require the accurate prediction of enzyme function. Based on a genomic sequence, enzymatic functions of gene products a...
Constantin Bannert, A. Welfle, C. aus dem Spring, ...