Sciweavers

2252 search results - page 17 / 451
» Improving Random Forests
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
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 ...
Glencora Borradaile, Philip N. Klein, Claire Mathi...
CVPR
2012
IEEE
11 years 10 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...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 8 months ago
A constant-factor approximation for stochastic Steiner forest
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...
Anupam Gupta, Amit Kumar
WCNC
2008
IEEE
14 years 2 months ago
An Improved Method for GPS-Based Network Position Location in Forests
—In this paper we present a technique for improving the location performance based on the Global Positioning System (GPS) for networks of nodes in harsh environments and demonstr...
Christopher L. Hutchens, Brian R. Sarbin, Alyse C....
MFCS
2009
Springer
14 years 14 days ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...