Sciweavers

40 search results - page 2 / 8
» The Value of Agreement, a New Boosting Algorithm
Sort
View
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
13 years 6 months ago
Boosting Optimal Logical Patterns Using Noisy Data
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Noam Goldberg, Chung-chieh Shan
CP
2006
Springer
13 years 8 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
ICDAR
2009
IEEE
13 years 11 months ago
New Algorithm of Straight or Curved Baseline Detection for Short Arabic Handwritten Writing
In this paper we present a new method of baseline detection of online or offline short handwriting. This work is part of a large project for the edification of a dual online / off...
Houcine Boubaker, Monji Kherallah, Adel M. Alimi
PRL
2007
118views more  PRL 2007»
13 years 4 months ago
Unifying multi-class AdaBoost algorithms with binary base learners under the margin framework
Multi-class AdaBoost algorithms AdaBooost.MO, -ECC and -OC have received a great attention in the literature, but their relationships have not been fully examined to date. In this...
Yijun Sun, Sinisa Todorovic, Jian Li
OPODIS
2010
13 years 2 months ago
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
Achour Mostéfaoui, Michel Raynal