Sciweavers

1068 search results - page 2 / 214
» Extremely randomized trees
Sort
View
ACCV
2009
Springer
13 years 12 months ago
Interactive Super-Resolution through Neighbor Embedding
Learning based super-resolution can recover high resolution image with high quality. However, building an interactive learning based super-resolution system for general images is e...
Jian Pu, Junping Zhang, Peihong Guo, Xiaoru Yuan
CVPR
2005
IEEE
14 years 7 months ago
Random Subwindows for Robust Image Classification
We present a novel, generic image classification method based on a recent machine learning algorithm (ensembles of extremely randomized decision trees). Images are classified usin...
Justus H. Piater, Louis Wehenkel, Pierre Geurts, R...
TSP
2010
13 years 1 days ago
Learning Gaussian tree models: analysis of error exponents and extremal structures
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
13 years 5 months ago
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
JCO
2010
97views more  JCO 2010»
13 years 3 months ago
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski