2252 search results - page 19 / 451 » Improving Random Forests |
DMTCS
2010
13 years 5 months ago
2010
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...
ECCC
2007
13 years 7 months ago
2007
DAGM
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. A successful approach to tracking is to on-line learn discriminative classifiers for the target objects. Although these trackingby-detection approaches are usually fast a...
ICPR
2010
IEEE
14 years 1 months ago
2010
IEEE
—Randomized learning methods (i.e., Forests or Ferns) have shown excellent capabilities for various computer vision applications. However, it was shown that the tree structure in...
ACL
1989
13 years 9 months ago
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...