204 search results - page 30 / 41 » A Half-Million Strong at Least |
CORR
2011
Springer
14 years 1 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
112
click to vote
NMR
2004
Springer
15 years 2 months ago
2004
Springer
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
114
click to vote
BMCBI
2007
14 years 9 months ago
2007
Background: Identification of protein interacting sites is an important task in computational molecular biology. As more and more protein sequences are deposited without available...
78
Voted
STOC
2002
ACM
15 years 10 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Distributed sensor data storage and retrieval has gained increasing popularity in recent years for supporting various applications. While distributed architecture enjoys a more ...