1390 search results - page 86 / 278 » Computing the depth of a flat |
COCO
1992
Springer
15 years 1 months ago
1992
Springer
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
3DPVT
2004
IEEE
15 years 1 months ago
2004
IEEE
In this paper, we present an algorithm to combine edge information from stereo-derived depth maps with edges from the original intensity/color image to improve the contour detecti...
SOFSEM
2005
Springer
15 years 3 months ago
2005
Springer
We give a new characterization of those languages that are definable in fragments of LTL where the nesting depths of X and U modalities are bounded by given constants. This brings...
NPAR
2004
ACM
15 years 3 months ago
2004
ACM
We describe a technique for generating cartoon style animations of smoke. Our method takes the output of a physically-based simulator and uses it to drive particles that are rende...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...