Sciweavers

1722 search results - page 276 / 345
» Ontology Formalism Transformation
Sort
View
IJCM
2002
73views more  IJCM 2002»
13 years 10 months ago
Space-Time Equations for Non-Unimodular Mappings
Abstract. The class of systems of uniform recurrence equations (UREs) is closed under unimodular transformations. As a result, every systolic array described by a unimodular mappin...
Jingling Xue, Patrick M. Lenders
IGPL
1998
97views more  IGPL 1998»
13 years 9 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
ICDE
2009
IEEE
160views Database» more  ICDE 2009»
13 years 7 months ago
Perm: Processing Provenance and Data on the Same Data Model through Query Rewriting
Data provenance is information that describes how a given data item was produced. The provenance includes source and intermediate data as well as the transformations involved in pr...
Boris Glavic, Gustavo Alonso
POPL
2010
ACM
14 years 7 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
ACISP
2009
Springer
14 years 4 months ago
Building Key-Private Public-Key Encryption Schemes
In the setting of identity-based encryption with multiple trusted authorities, TA anonymity formally models the inability of an adversary to distinguish two ciphertexts correspondi...
Kenneth G. Paterson, Sriramkrishnan Srinivasan