1068 search results - page 136 / 214 » Extremely randomized trees |
79
Voted
DRM
2007
Springer
15 years 6 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
119
Voted
ISCC
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
106
click to vote
ISAAC
1998
Springer
15 years 4 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
124
Voted
AUSDM
2006
Springer
15 years 4 months ago
2006
Springer
In response to the rapid development of DNA Microarray technology, many classification methods have been used for Microarray classification. SVMs, decision trees, Bagging, Boostin...
108
Voted
EJC
2006
15 years 17 days ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...