2474 search results - page 11 / 495 » Learning Languages in a Union |
RP
2010
Springer
13 years 5 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
EACL
1989
ACL Anthology
13 years 8 months ago
1989
ACL Anthology
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
JMLR
2012
11 years 10 months ago
2012
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
Machine learning techniques are widely used in negotiation systems. To get more accurate and satisfactory learning results, negotiation parties have the desire to employ learning ...
IFIP
1999
Springer
13 years 11 months ago
1999
Springer
