198 search results - page 4 / 40 » Learning Unary Automata |
120
Voted
ALT
2005
Springer
15 years 10 months ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
129
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
We present MI-CRF, a conditional random field (CRF) model for multiple instance learning (MIL). MI-CRF models bags as nodes in a CRF with instances as their states. It combines di...
LATA
2010
Springer
15 years 8 months ago
2010
Springer
91
Voted
LATA
2009
Springer
15 years 8 months ago
2009
Springer
201
click to vote
POPL
2002
ACM
16 years 2 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...