Sciweavers

1068 search results - page 3 / 214
» Extremely randomized trees
Sort
View
CVPR
2006
IEEE
14 years 8 months ago
AdaBoost.MRF: Boosted Markov Random Forests and Application to Multilevel Activity Recognition
Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov r...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh, ...
IJAR
2010
105views more  IJAR 2010»
13 years 3 months ago
A tree augmented classifier based on Extreme Imprecise Dirichlet Model
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
G. Corani, C. P. de Campos
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
13 years 6 months ago
Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes
We consider a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compos...
Brad Jackson, Frank Ruskey
DAM
2006
47views more  DAM 2006»
13 years 6 months ago
Trees of extremal connectivity index
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
Huiqing Liu, Mei Lu, Feng Tian
DM
2008
61views more  DM 2008»
13 years 6 months ago
Neighborhood unions and extremal spanning trees
Evelyne Flandrin, Tomás Kaiser, Roman Kuzel...