5904 search results - page 887 / 1181 » Requirements for a Composition Language |
133
click to vote
COLING
2002
15 years 3 months ago
2002
It is shown that basic language processes such as the production of free word associations and the generation of synonyms can be simulated using statistical models that analyze th...
127
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
111
Voted
ETS
2000
IEEE
15 years 3 months ago
2000
IEEE
This paper presents a case study of a web-based on-line collaborative academic writing project by students of English as a Foreign Language (EFL) at two Higher Education instituti...
138
Voted
JACM
2002
15 years 3 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
110
Voted
CORR
1999
Springer
15 years 3 months ago
1999
Springer
We recently presented a methodology to quantitatively reduce the average time and variance in the time required to execute electronic transactions in a network environment such as...