2944 search results - page 291 / 589 » On Well Quasi-orders on Languages |
169
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Many advanced data management operations (e.g., incremental maintenance, trust assessment, debugging schema mappings, keyword search over databases, or query answering in probabil...
187
click to vote
SIGCSE
1990
ACM
15 years 10 months ago
1990
ACM
This paper presents a philosophy underlying CS-1 programming projects, and illustrates this philosophy with a concrete example. Integral to the philosophy is the use of Ada packag...
184
click to vote
DBPL
1995
Springer
15 years 10 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
217
click to vote
CASES
2005
ACM
15 years 8 months ago
2005
ACM
The concurrent synchronous language Esterel allows proto treat reactive systems in an abstract, concise manner. An Esterel program is typically first translated into other, non-s...
151
click to vote
CLEF
2008
Springer
15 years 8 months ago
2008
Springer
ParaMor, our unsupervised morphology induction system performed well at Morpho Challenge 2008. When ParaMor's morphological analyses, which specialize at identifying inflecti...