246 search results - page 14 / 50 » Calibrating Random Forests |
KDD
2012
ACM
11 years 10 months ago
2012
ACM
FOCS
2008
IEEE
14 years 2 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 ...
CVPR
2012
IEEE
11 years 10 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
14 years 8 months 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...