3324 search results - page 58 / 665 » Learning Appropriate Contexts |
SIGCSE
2006
ACM
15 years 4 months ago
2006
ACM
A hands-on embedded computing project is introduced into an undergraduate social sciences course. In the pilot module, nine student teams created working prototypes, using the tec...
UM
2005
Springer
15 years 4 months ago
2005
Springer
Inference and decision making with probabilistic user models may be infeasible on portable devices such as cell phones. We highlight the opportunity for storing and using precomput...
99
Voted
ECML
2003
Springer
15 years 4 months ago
2003
Springer
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...
90
Voted
COLT
1992
Springer
15 years 3 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
96
Voted
ICFEM
2009
Springer
15 years 5 months ago
2009
Springer
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation extending one’s goal with additional lemmas, ...