1036 search results - page 74 / 208 » Algorithms for Learning Regular Expressions |
103
Voted
BIRTHDAY
2004
Springer
15 years 7 months ago
2004
Springer
We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...
153
click to vote
AMFG
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we propose the concept of Manifold of Facial Expression based on the observation that images of a subject’s facial expressions define a smooth manifold in the hig...
108
click to vote
JALC
2007
15 years 1 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
117
click to vote
COLT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
116
click to vote
COLT
2005
Springer
15 years 7 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...