1068 search results - page 83 / 214 » Extremely randomized trees |
IPPS
2003
IEEE
14 years 3 months ago
2003
IEEE
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
VVS
1996
IEEE
14 years 2 months ago
1996
IEEE
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...
CPC
2008
13 years 10 months ago
2008
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
A cross-layer optimization approach is adopted for the design of symmetric random access wireless systems. Instead of the traditional collision model, a more realistic physical la...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...