Sciweavers

462 search results - page 18 / 93
» Covering a Tree by a Forest
Sort
View
ICIC
2009
Springer
13 years 5 months ago
Towards a Better Understanding of Random Forests through the Study of Strength and Correlation
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...
Simon Bernard, Laurent Heutte, Sébastien Ad...
ICIP
2009
IEEE
13 years 5 months ago
An incremental extremely random forest classifier for online learning and tracking
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...
Aiping Wang, Guowei Wan, Zhiquan Cheng, Sikun Li
CGI
2006
IEEE
14 years 1 months ago
Quasi-physical Simulation of Large-Scale Dynamic Forest Scenes
This paper presents a quasi-physically based approach for interactively simulating large-scale dynamic forest scenes under different wind conditions. We introduce theories from th...
Long Zhang, Chengfang Song, Qifeng Tan, Wei Chen, ...
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 7 months ago
Approximating the minimum directed tree cover
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
Viet Hung Nguyen
LATIN
2010
Springer
14 years 2 months ago
Some Observations on Holographic Algorithms
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
Leslie G. Valiant