Sciweavers

1390 search results - page 16 / 278
» Computing the depth of a flat
Sort
View
ESA
2000
Springer
122views Algorithms» more  ESA 2000»
15 years 1 months ago
Minimum Depth Graph Embedding
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...
Maurizio Pizzonia, Roberto Tamassia
VMV
2001
161views Visualization» more  VMV 2001»
14 years 11 months ago
Efficient Generation of 3-D Models Out of Depth Maps
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...
Fabian Ernst, Cornelius W. A. M. van Overveld, Pio...
FOCS
2008
IEEE
15 years 4 months ago
Arithmetic Circuits: A Chasm at Depth Four
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...
Manindra Agrawal, V. Vinay
WACV
2012
IEEE
13 years 5 months ago
Real-time stereo and flow-based video segmentation with superpixels
The use of depth is becoming increasingly popular in real-time computer vision applications. However, when using real-time stereo for depth, the quality of the disparity image is ...
Michael Van den Bergh, Luc J. Van Gool
77
Voted
P2P
2006
IEEE
15 years 3 months ago
Cost-Based Analysis of Hierarchical DHT Design
Flat DHT architectures have been the main focus of the research on DHT design so far. However, there have been also a number of works proposing hierarchical DHT organizations and ...
Stefan Zöls, Zoran Despotovic, Wolfgang Kelle...