1445 search results - page 144 / 289 » Uniformly Hard Languages |
161
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
This paper evaluates the different tasks carried out in the translation of pronominal anaphora in a machine translation (MT) system. The MT interlingua approach named AGIR (Anaph...
221
click to vote
DOCENG
2011
ACM
14 years 3 months ago
2011
ACM
A use case involving integrating results from search engines illustrates how the meta-metadata language facilitates interoperable metadata semantics. Formal semantics can be hard ...
183
click to vote
ESOP
2012
Springer
13 years 11 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
158
click to vote
IUI
2012
ACM
13 years 11 months ago
2012
ACM
As applications are developed, functional tests ensure they continue to function as expected. Nowadays, functional testing is mostly done manually, with human testers verifying a ...
364
click to vote
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...