104 search results - page 16 / 21 » A Greedy Algorithm Estimating the Height of Random Trees |
111
Voted
PAMI
2007
14 years 11 months ago
2007
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...
138
Voted
ECCV
2008
Springer
15 years 10 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
115
Voted
ALGOSENSORS
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
86
Voted
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
We propose a fast approach to 3?D object detection and pose estimation that owes its robustness to a training phase during which the target object slowly moves with respect to the ...