Sciweavers

40 search results - page 4 / 8
» The Value of Agreement, a New Boosting Algorithm
Sort
View
BMCBI
2010
126views more  BMCBI 2010»
13 years 8 months ago
A boosting method for maximizing the partial area under the ROC curve
Background: The receiver operating characteristic (ROC) curve is a fundamental tool to assess the discriminant performance for not only a single marker but also a score function c...
Osamu Komori, Shinto Eguchi
PODC
2012
ACM
11 years 10 months ago
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
James Aspnes
ISPDC
2006
IEEE
14 years 1 months ago
Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
Piotr Zielinski
PODC
2010
ACM
13 years 11 months ago
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
James Aspnes
TIT
2002
164views more  TIT 2002»
13 years 7 months ago
On the generalization of soft margin algorithms
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
John Shawe-Taylor, Nello Cristianini