1068 search results - page 39 / 214 » Extremely randomized trees |
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
IDEAS
2007
IEEE
14 years 3 months ago
2007
IEEE
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
RECOMB
2008
Springer
14 years 9 months ago
2008
Springer
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, ...
VISUALIZATION
1998
IEEE
14 years 28 days ago
1998
IEEE
Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to la...
GPEM
2000
13 years 8 months ago
2000
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...