Sciweavers

1068 search results - page 23 / 214
» Extremely randomized trees
Sort
View
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
14 years 5 days ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
VMV
2008
107views Visualization» more  VMV 2008»
13 years 10 months ago
Learning with Few Examples using a Constrained Gaussian Prior on Randomized Trees
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
Erik Rodner, Joachim Denzler
COMBINATORICA
2010
13 years 6 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
CVPR
2008
IEEE
14 years 10 months ago
Randomized trees for human pose detection
This paper addresses human pose recognition from video sequences by formulating it as a classification problem. Unlike much previous work we do not make any assumptions on the ava...
Grégory Rogez, Jonathan Rihan, Srikumar Ram...
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 8 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha