Sciweavers

87 search results - page 2 / 18
» Dynamic Maximum Tree Depth
Sort
View
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
13 years 12 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
PAMI
2010
188views more  PAMI 2010»
13 years 3 months ago
Spatial-Temporal Fusion for High Accuracy Depth Maps Using Dynamic MRFs
— Time-of-flight range sensors and passive stereo have complimentary characteristics in nature. To fuse them to get high accuracy depth maps varying over time, we extend traditi...
Jiejie Zhu, Liang Wang 0002, Jizhou Gao, Ruigang Y...
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 2 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
ICASSP
2007
IEEE
13 years 9 months ago
Depth Detection of Light Field
We propose an algorithm to detect depths in a light field. Specifically, given a 4D light field, we find all planes at which objects are located. Although the exact depth of each ...
Yi-Hao Kao, Chia-Kai Liang, Li-Wen Chang, Homer H....
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Performance bounds for peer-assisted live streaming
Peer-assisted streaming is a promising way for service providers to offer high-quality IPTV to consumers at reasonable cost. In peerassisted streaming, the peers exchange video ch...
Shao Liu, Rui Zhang-Shen, Wenjie Jiang, Jennifer R...