Sciweavers

701 search results - page 35 / 141
» Self Bounding Learning Algorithms
Sort
View
ICDAR
1999
IEEE
14 years 1 months ago
Cursive Character Detection using Incremental Learning
This paper describes a new hybrid architecture for an artificial neural network classifier that enables incremental learning. The learning algorithm of the proposed architecture d...
Jean-François Hébert, Marc Parizeau,...
WDAG
1995
Springer
103views Algorithms» more  WDAG 1995»
14 years 1 months ago
Self-Stabilization of Wait-Free Shared Memory Objects
This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every executio...
Jaap-Henk Hoepman, Marina Papatriantafilou, Philip...
ICML
2003
IEEE
14 years 10 months ago
Learning To Cooperate in a Social Dilemma: A Satisficing Approach to Bargaining
Learning in many multi-agent settings is inherently repeated play. This calls into question the naive application of single play Nash equilibria in multi-agent learning and sugges...
Jeff L. Stimpson, Michael A. Goodrich
FOCS
1990
IEEE
14 years 1 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
COLT
2000
Springer
14 years 1 months ago
Leveraging for Regression
In this paper we examine master regression algorithms that leverage base regressors by iteratively calling them on modified samples. The most successful leveraging algorithm for c...
Nigel Duffy, David P. Helmbold