129 search results - page 19 / 26 » Learning DFA from Simple Examples |
SCHOLARPEDIA
2008
13 years 7 months ago
2008
: We describe computer simulation of a number of associative models of classical conditioning in an attempt to assess the strengths and weaknesses of each model. The behavior of th...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Boosting-basedmethods have recently led to the state-ofthe-art face detection systems. In these systems, weak classifiers to be boosted are based on simple, local, Haar-like featu...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
We propose a new stopping condition for a Support Vector Machine (SVM) solver which precisely reflects the objective of the Leave-OneOut error computation. The stopping condition ...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We present a novel approach to address the representation issue and the matching issue in face recognition (verification). Firstly, our approach encodes the micro-structures of t...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...