1068 search results - page 92 / 214 » Extremely randomized trees |
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
PIMRC
2008
IEEE
14 years 4 months ago
2008
IEEE
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
ALIFE
2004
13 years 10 months ago
2004
Phylogenetic trees group organisms by their ancestral relationships. There are a number of distinct algorithms used to reconstruct these trees from molecular sequence data, but dif...
CATA
2009
13 years 11 months ago
2009
The nearest shrunken centroid classifier uses shrunken centroids as prototypes for each class and test samples are classified to belong to the class whose shrunken centroid is nea...