Sciweavers

20 search results - page 2 / 4
» Linearly decodable functions from neural population codes
Sort
View
CORR
2010
Springer
158views Education» more  CORR 2010»
14 years 6 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel
IJON
2006
90views more  IJON 2006»
14 years 9 months ago
Adaptive sensory processing for efficient place coding
This work presents a neural model of self-localisation implemented on a simulated mobile robot with a realistic visual input. A population of modelled place cells with overlapping...
Denis Sheynikhovich, Ricardo Chavarriaga, Thomas S...
COCOON
2009
Springer
15 years 4 months ago
Limits to List Decoding Random Codes
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...
Atri Rudra
BC
2007
107views more  BC 2007»
14 years 9 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
ICALP
2005
Springer
15 years 3 months ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf