1068 search results - page 9 / 214 » Extremely randomized trees |
CPC
2008
13 years 8 months ago
2008
Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finite, unlabeled) tree. Assuming that every tree of Tn is equally likely, it is shown that the...
BMCBI
2008
13 years 8 months ago
2008
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
COMBINATORICA
2006
13 years 8 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
JCC
2008
13 years 8 months ago
2008
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
IJON
2010
13 years 7 months ago
2010
An active learner usually assumes there are some labeled data available based on which a moderate classifier is learned and then examines unlabeled data to manually label the mos...