12836 search results - page 471 / 2568 » Generalization Methods in Bioinformatics |
195
Voted
COCO
2004
Springer
16 years 7 days ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
166
click to vote
EWCBR
1993
Springer
15 years 11 months ago
1993
Springer
Problem solving in weak theory domains should compensate for the lack of strong theories by combining the various other knowledge types involved. Such methods should be able to eff...
216
click to vote
JMLR
2012
13 years 9 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
196
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
During the last decade, the area of bioinformatics has produced an overwhelming amount of data, with the recently published draft of the human genome being the most prominent exam...
247
click to vote
RECOMB
2002
Springer
16 years 7 months ago
2002
Springer
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...