164 search results - page 10 / 33 » Rewriting Extended Regular Expressions |
102
click to vote
LCR
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Modern dialects of Fortran enjoy wide use and good support on highperformance computers as performance-oriented programming languages. By providing the ability to express...
163
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
The performance of XML database queries can be greatly enhanced by rewriting them using materialized views. We study the problem of rewriting a query using materialized views, whe...
ANCS
2007
ACM
15 years 1 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
FSMNLP
2005
Springer
15 years 2 months ago
2005
Springer
We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expres...
CADE
2001
Springer
15 years 9 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...