1068 search results - page 125 / 214 » Extremely randomized trees |
126
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We present a method to classify and localize human actions in video using a Hough transform voting framework. Random trees are trained to learn a mapping between densely-sampled f...
119
click to vote
CSB
2003
IEEE
15 years 8 months ago
2003
IEEE
A new and essentially simple method to reconstruct prokaryotic phylogenetic trees from their complete genome data without using sequence alignment is proposed. It is based on the ...
116
click to vote
AAAI
1996
15 years 4 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
124
click to vote
ICCAD
2006
IEEE
16 years 9 days ago
2006
IEEE
Because of the increasing dominance of interconnect issues in advanced IC technology, placement has become a critical step in the IC design flow. To get accurate interconnect inf...
128
click to vote
ICESS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider broadcast protocols in wireless networks that have limited energy and computation resources. The well-known algorithm, DBIP (Directional Broadcast Incremental...