6715 search results - page 1228 / 1343 » Learning from a Test Set |
131
click to vote
LICS
2002
IEEE
15 years 9 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
155
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
121
click to vote
ALMOB
2007
15 years 4 months ago
2007
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...
146
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Homology is a crucial concept in comparative genomics. The algorithm probably most widely used for homology detection in comparative genomics, is BLAST. Usually a stri...
128
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: The selection of genes that discriminate disease classes from microarray data is widely used for the identification of diagnostic biomarkers. Although various gene sel...