214 search results - page 17 / 43 » Semi-Supervised Random Forests |
KDD
2012
ACM
13 years 2 months ago
2012
ACM
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
150
click to vote
CVPR
2012
IEEE
13 years 2 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...
STOC
2009
ACM
16 years 9 days ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we present a monocular camera based terrain classification scheme. The uniqueness of the proposed scheme is that it inherently incorporates spatial smoothness while...