3827 search results - page 155 / 766 » The Epsilon Generation Language |
111
Voted
SAS
1994
Springer
15 years 9 months ago
1994
Springer
Abstract. Our aim is to study how the interpretive approach -- inserting an interpreter between a source program and a program specializer -- can be used to improve the transformat...
141
Voted
FOCS
1995
IEEE
15 years 8 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
126
Voted
ACL
2003
15 years 6 months ago
2003
We introduce a MetaGrammar, which allows us to automatically generate, from a single and compact MetaGrammar hierarchy, parallel Lexical Functional Grammars (LFG) and Tree-Adjoini...
142
click to vote
ACL
1998
15 years 6 months ago
1998
This paper demonstrates that generating arguments in natural language requires at an abstract level, and that the ate abstraction cannot be captured by approaches based solely upo...
165
click to vote
COMPSAC
2002
IEEE
15 years 10 months ago
2002
IEEE
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...