1134 search results - page 6 / 227 » Sequential Inductive Learning |
105
click to vote
ALT
2006
Springer
15 years 9 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
124
Voted
JMLR
2010
14 years 7 months ago
2010
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while...
88
Voted
DATE
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper focuses on checking safety properties for sequential circuits specified on the RT-level. We study how different state encodings can be used to create a gate-level repr...
118
Voted
KBS
2002
15 years 14 days ago
2002
Lists of if
87
Voted
AAAI
1996
15 years 2 months ago
1996
Inductive algorithms rely strongly on their representational biases, Constructive induction can mitigate representational inadequacies. This paper introduces the notion of a relat...