2333 search results - page 189 / 467 » Recursive Computational Depth |
151
click to vote
STOC
1997
ACM
15 years 10 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
168
click to vote
TGC
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computation...
169
click to vote
MCU
1998
15 years 7 months ago
1998
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
169
click to vote
AML
2008
15 years 6 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
148
click to vote
PR
2006
15 years 6 months ago
2006
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...