2333 search results - page 139 / 467 » Recursive Computational Depth |
ICIP
2000
IEEE
14 years 11 months ago
2000
IEEE
This paper reviews a number of recently developed stereo matching algorithms and representations. It focuses on techniques that are especially well suited for stereoscopic and 3-D...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We define and construct efficient depth-universal and almostsize-universal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central classes ...
FPGA
1997
ACM
14 years 1 months ago
1997
ACM
In this paper, we give a necessary and sufficient condition for the existence of partially-dependent functional decomposition and develop new algorithms to compute such decomposi...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see