Sciweavers

1042 search results - page 4 / 209
» Fast Population Coding
Sort
View
ISCAS
2006
IEEE
90views Hardware» more  ISCAS 2006»
14 years 1 months ago
Feature competition in a spike-based winner-take-all VLSI network
— Recurrent networks and hardware analogs that perform a winner-take-all computation have been studied extensively. This computation is rarely demonstrated in a spiking network o...
Shih-Chii Liu, Matthias Oster
IJCAI
1997
13 years 9 months ago
Combining Probabilistic Population Codes
We study the problemof statisticallycorrect inference in networks whose basic representations are population codes. Population codes are ubiquitous in the brain, and involve the s...
Richard S. Zemel, Peter Dayan
NIPS
1996
13 years 9 months ago
Probabilistic Interpretation of Population Codes
We present a general encoding-decoding framework for interpreting the activity of a population of units. A standard population code interpretation method, the Poisson model, start...
Richard S. Zemel, Peter Dayan, Alexandre Pouget
EC
1998
121views ECommerce» more  EC 1998»
13 years 7 months ago
Effects of Code Growth and Parsimony Pressure on Populations in Genetic Programming
Parsimony pressure, the explicit penalization of larger programs, has been increasingly used as a means of controlling code growth in genetic programming. However, in many cases p...
Terence Soule, James A. Foster
NIPS
2001
13 years 9 months ago
Correlation Codes in Neuronal Populations
Population codes often rely on the tuning of the mean responses to the stimulus parameters. However, this information can be greatly suppressed by long range correlations. Here we...
Maoz Shamir, Haim Sompolinsky