Sciweavers

17 search results - page 2 / 4
» Population coding with unreliable spikes
Sort
View
ISCAS
2006
IEEE
90views Hardware» more  ISCAS 2006»
13 years 11 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
BC
2007
107views more  BC 2007»
13 years 5 months ago
Decoding spike train ensembles: tracking a moving stimulus
We consider the issue of how to read out the information from nonstationary spike train ensembles. Based on the theory of censored data in statistics, we propose a ‘censored’ m...
Enrico Rossoni, Jianfeng Feng
IJON
2006
100views more  IJON 2006»
13 years 5 months ago
Analyzing the robustness of redundant population codes in sensory and feature extraction systems
Sensory systems often use groups of redundant neurons to represent stimulus information both during transduction and population coding of features. This redundancy makes the syste...
Christopher J. Rozell, Don H. Johnson
NIPS
2004
13 years 7 months ago
Learning Efficient Auditory Codes Using Spikes Predicts Cochlear Filters
The representation of acoustic signals at the cochlear nerve must serve a wide range of auditory tasks that require exquisite sensitivity in both time and frequency. Lewicki (2002...
Evan C. Smith, Michael S. Lewicki
NIPS
2003
13 years 7 months ago
Prediction on Spike Data Using Kernel Algorithms
We report and compare the performance of different learning algorithms based on data from cortical recordings. The task is to predict the orientation of visual stimuli from the ac...
Jan Eichhorn, Andreas S. Tolias, Alexander Zien, M...