Sciweavers

148 search results - page 6 / 30
» The random Tukey depth
Sort
View
AINA
2007
IEEE
14 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
CVPR
2006
IEEE
14 years 1 months ago
Combined Depth and Outlier Estimation in Multi-View Stereo
In this paper, we present a generative model based approach to solve the multi-view stereo problem. The input images are considered to be generated by either one of two processes:...
Christoph Strecha, Rik Fransens, Luc J. Van Gool
CC
2010
Springer
282views System Software» more  CC 2010»
13 years 5 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
CRV
2007
IEEE
161views Robotics» more  CRV 2007»
14 years 1 months ago
Dense Stereo Range Sensing with Marching Pseudo-Random Patterns
As an extension to classical structured lighting techniques, the use of bi-dimensional pseudo-random color codes is explored to perform range sensing with variable density from a ...
Danick Desjardins, Pierre Payeur
JMIV
2002
100views more  JMIV 2002»
13 years 7 months ago
Analysis of Echoes in Single-Image Random-Dot-Stereograms
Three-dimensional depth information of a surface can be encoded in a two-dimensional image called single-image random-dotstereograms or, more widely known, autostereograms. It is ...
Mark S. K. Lau, C. P. Kwong