498 search results - page 72 / 100 » Term Rewriting |
IDEAS
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relatio...
ASAP
2005
IEEE
15 years 3 months ago
2005
IEEE
The COMPAAN/LAURA [18] tool chain maps nested loop applications written in Matlab onto reconfigurable platforms, such as FPGAs. COMPAAN rewrites the original Matlab application a...
83
Voted
ACMSE
2005
ACM
15 years 3 months ago
2005
ACM
A simple extension to the relational model that permits metadata (more generally metaknowledge) to be stored and manipulated as first class data is proposed. The accompanying que...
75
Voted
CCS
2005
ACM
15 years 3 months ago
2005
ACM
We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain u...
64
Voted
RTA
2005
Springer
15 years 3 months ago
2005
Springer
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...