2333 search results - page 44 / 467 » Recursive Computational Depth |
FOCS
1991
IEEE
15 years 4 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
83
Voted
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
ACSE
1998
ACM
15 years 4 months ago
1998
ACM
69
Voted
GREC
1997
Springer
15 years 4 months ago
1997
Springer
120
Voted
CVPR
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we propose an algorithm for estimating dense depth information of dynamic scenes from multiple video streams captured using unsynchronized stationary cameras. We so...