13784 search results - page 1989 / 2757 » On Computing Functions with Uncertainty |
208
click to vote
RECOMB
2004
Springer
16 years 8 months ago
2004
Springer
In this paper, we explore modeling overlapping biological processes. We discuss a probabilistic model of overlapping biological processes, gene membership in those processes, and ...
199
click to vote
RECOMB
2003
Springer
16 years 8 months ago
2003
Springer
The correct interpretation of tandem mass spectra is a difficult problem, even when it is limited to scoring peptides against a database. De novo sequencing is considerably harder...
162
click to vote
RECOMB
2001
Springer
16 years 8 months ago
2001
Springer
We address possible limitations of publicly available data sets of yeast gene expression. We study the predictability of known regulators via time-series analysis, and show that l...
188
click to vote
STOC
2003
ACM
16 years 8 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
205
click to vote
STOC
2002
ACM
16 years 8 months ago
2002
ACM
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...