Sciweavers

2252 search results - page 26 / 451
» Improving Random Forests
Sort
View
DAGSTUHL
2007
13 years 9 months ago
Agents, Norms and Forest Cleaning
The automation of forest cleaning presupposes principles for choosing those trees that ought to be taken away and those that shall be left standing. In this paper, which is a repor...
Jan Odelstad
ACL
2007
13 years 9 months ago
Forest Rescoring: Faster Decoding with Integrated Language Models
Efficient decoding has been a fundamental problem in machine translation, especially with an integrated language model which is essential for achieving good translation quality. ...
Liang Huang, David Chiang
JPDC
2006
134views more  JPDC 2006»
13 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ICPR
2010
IEEE
14 years 1 months ago
Forest Species Recognition Using Color-Based Features
In this work we address the problem of forest species recognition which is a very challenging task and has several potential applications in the wood industry. The first contribu...
Pedro Luiz Paula, Luiz Oliveira, Alceu Britto, R. ...
PRICAI
2000
Springer
13 years 11 months ago
The Lumberjack Algorithm for Learning Linked Decision Forests
While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...
William T. B. Uther, Manuela M. Veloso