198 search results - page 24 / 40 » Learning Unary Automata |
117
Voted
COLT
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas,...
159
click to vote
CAV
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
114
click to vote
LACL
2001
Springer
15 years 6 months ago
2001
Springer
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
168
click to vote
STOC
2000
ACM
15 years 6 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
107
click to vote
SIGCSE
2009
ACM
16 years 2 months ago
2009
ACM
We describe the results from a two-year study with fourteen universities on presenting formal languages in a more visual, interactive and applied manner using JFLAP. In our result...