1591 search results - page 87 / 319 » Random lifts of graphs |
248
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
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...
178
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
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 ...
153
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
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...
192
click to vote
HT
2010
ACM
15 years 8 months ago
2010
ACM
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 ...
188
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...