5964 search results - page 122 / 1193 » A theory of speculative computation |
106
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see
129
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
170
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
We propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magne...
143
click to vote
STOC
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
134
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, the implication of the relations of information in the case of multispectral images is analyzed. Higher-order mutual information can adopt positive or negative valu...