Sciweavers

1949 search results - page 105 / 390
» Random graphs on surfaces
Sort
View
CVPR
2012
IEEE
13 years 6 months ago
Graph cuts optimization for multi-limb human segmentation in depth maps
We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps...
Antonio Hernández-Vela, Nadezhda Zlateva, A...
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
15 years 5 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
ICALP
2009
Springer
15 years 11 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
CVIU
2008
95views more  CVIU 2008»
15 years 4 months ago
The visual hull of piecewise smooth objects
The visual hull relates the shape of an object to its silhouettes. This paper develops the theory of the visual hull of piecewise smooth objects, as those used in CAD applications...
Andrea Bottino, Aldo Laurentini
HT
2010
ACM
15 years 6 months ago
Analysis of graphs for digital preservation suitability
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
Charles L. Cartledge, Michael L. Nelson