Sciweavers

164 search results - page 10 / 33
» Rewriting Extended Regular Expressions
Sort
View
LCR
1998
Springer
109views System Software» more  LCR 1998»
14 years 23 days ago
Expressing Irregular Computations in Modern Fortran Dialects
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...
Jan Prins, Siddhartha Chatterjee, Martin Simons
VLDB
2007
ACM
152views Database» more  VLDB 2007»
14 years 8 months ago
Structured Materialized Views for XML Queries
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...
Andrei Arion, Ioana Manolescu, Véronique Be...
ANCS
2007
ACM
14 years 17 days ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
FSMNLP
2005
Springer
14 years 2 months ago
Finite-State Registered Automata and Their Uses in Natural Languages
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...
Yael Cohen-Sygal, Shuly Wintner
CADE
2001
Springer
14 years 8 months ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
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...
Xavier Urbain