1068 search results - page 37 / 214 » Extremely randomized trees |
ISCAS
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper we propose a method for lowering the power consumption in our previously proposed method for approximating elementary functions. By rearranging the interconnect o...
ICMLA
2007
13 years 10 months ago
2007
For both single probability estimation trees (PETs) and ensembles of such trees, commonly employed class probability estimates correct the observed relative class frequencies in e...
RECOMB
2006
Springer
14 years 9 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
MMM
2011
Springer
13 years 11 days ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
CC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...