701 search results - page 4 / 141 » Self Bounding Learning Algorithms |
SOFSEM
1997
Springer
13 years 11 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
ESANN
2006
13 years 9 months ago
2006
The training of Emergent Self-organizing Maps (ESOM ) with large datasets can be a computationally demanding task. Batch learning may be used to speed up training. It is demonstrat...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...
COLT
1995
Springer
13 years 11 months ago
1995
Springer
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
EMNLP
2008
13 years 9 months ago
2008
We present an algorithmic framework for learning multiple related tasks. Our framework exploits a form of prior knowledge that relates the output spaces of these tasks. We present...