1418 search results - page 192 / 284 » The Dynamic Complexity of Formal Languages |
141
click to vote
WMPI
2004
ACM
15 years 10 months ago
2004
ACM
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
144
click to vote
ICFP
2010
ACM
15 years 6 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
144
click to vote
PADL
2012
Springer
14 years 15 days ago
2012
Springer
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...
129
click to vote
IUI
1993
ACM
15 years 9 months ago
1993
ACM
We discuss current approaches to the development of natural language dialogue systems, and claim that they do not sufficiently consider the unique qualities of man-machine intera...
168
Voted
IJCAI
2003
15 years 6 months ago
2003
Dynamic Bayesian networks (DBNs) offer an elegant way to integrate various aspects of language in one model. Many existing algorithms developed for learning and inference in DBNs ...