2040 search results - page 19 / 408 » On the Complexity of Error Explanation |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
ENTCS
2011
13 years 2 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
EEMMAS
2007
Springer
14 years 1 months ago
2007
Springer
Although there is a huge amount of work and valuable proposals about agent oriented software engineering, it seems that the paradigm has not been fully accepted yet by software ind...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
ICANN
2005
Springer
14 years 1 months ago
2005
Springer
Humans can recognize biological motion from strongly impoverished stimuli, like point-light displays. Although the neural mechanism underlying this robust perceptual process have n...