2512 search results - page 312 / 503 » Learning from Highly Structured Data by Decomposition |
132
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
Given a binary classification task, a ranker sorts a set of instances from highest to lowest expectation that the instance is positive. We propose a lexicographic ranker, LexRank,...
181
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: The multitude of motif detection algorithms developed to date have largely focused on the detection of patterns in primary sequence. Since sequence-dependent DNA struc...
137
click to vote
IDEAS
2005
IEEE
15 years 9 months ago
2005
IEEE
A substantial subset of the web data follows some kind of underlying structure. Nevertheless, HTML does not contain any schema or semantic information about the data it represents...
132
click to vote
ENTCS
2008
15 years 4 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
133
click to vote
TCBB
2008
15 years 3 months ago
2008
When accounting for structural fluctuations or measurement errors, a single rigid structure may not be sufficient to represent a protein. One approach to solve this problem is to r...