Sciweavers

2621 search results - page 63 / 525
» Near orders and codes
Sort
View
IJON
2002
83views more  IJON 2002»
15 years 4 months ago
Population coding with unreliable spikes
The need for a neuronal coding scheme that is robust against the corruption of action potentials seems to support the idea of population rate coding, where the relevance of a sing...
Matthias Bethge, Klaus Pawelzik
ICC
2008
IEEE
119views Communications» more  ICC 2008»
15 years 10 months ago
Diversity Analysis of coded SVD Schemes for MIMO Spatial Multiplexing Systems
— When channel state information (CSI) is available at both transmit and receive sides, singular value decomposition (SVD) converts the MIMO channel into parallel subchannels. It...
Kyoung-Jae Lee, Inkyu Lee
ICSM
2009
IEEE
15 years 11 months ago
BCC: Enhancing code completion for better API usability
Nowadays, programmers spend much of their workday dealing with code libraries and frameworks that are bloated with APIs. One common way of interacting with APIs is through Code Co...
David M. Pletcher, Daqing Hou
IPL
2011
96views more  IPL 2011»
14 years 10 months ago
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Vincent Vajnovszki, Rémi Vernay
CIE
2010
Springer
15 years 4 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov