2333 search results - page 12 / 467 » Recursive Computational Depth |
CIE
2007
Springer
14 years 2 months ago
2007
Springer
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...
LCPC
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents recursion unrolling, a technique for improving the performance of recursive computations. Conceptually, recursion unrolling inlines recursive calls to reduce c...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
VMV
2001
13 years 9 months ago
2001
Depth reconstruction or acquisition with a 3-D camera results in a video sequence where each pixel of a frame is annotated with a depth value. We propose an approach to combine th...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for expo...