Sciweavers

513 search results - page 45 / 103
» Reduction Transformations in ORM
Sort
View
LFP
1992
153views more  LFP 1992»
15 years 1 months ago
Reasoning About Programs in Continuation-Passing Style
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
Amr Sabry, Matthias Felleisen
JELIA
2004
Springer
15 years 5 months ago
tascpl: TAS Solver for Classical Propositional Logic
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
Manuel Ojeda-Aciego, Agustín Valverde
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
16 years 7 days ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
IMA
2005
Springer
52views Cryptology» more  IMA 2005»
15 years 5 months ago
Domain Expansion of MACs: Alternative Uses of the FIL-MAC
In this paper, a study of a paradigm for domain expansion of MACs is generalized. In particular, a tradeoff between the efficiency of a MAC and the tightness of its security reduc...
Ueli M. Maurer, Johan Sjödin
IPPS
1998
IEEE
15 years 4 months ago
On the Automatic Validation of Parameterized Unity Programs
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
Jean-Paul Bodeveix, Mamoun Filali