Sciweavers

1175 search results - page 28 / 235
» Abstract computability and algebraic specification
Sort
View
PPAM
2005
Springer
14 years 1 months ago
Adapting Linear Algebra Codes to the Memory Hierarchy Using a Hypermatrix Scheme
Abstract. We present the way in which we adapt data and computations to the underlying memory hierarchy by means of a hierarchical data structure known as hypermatrix. The applicat...
José R. Herrero, Juan J. Navarro
FM
2006
Springer
153views Formal Methods» more  FM 2006»
13 years 11 months ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
APAL
2010
123views more  APAL 2010»
13 years 7 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
13 years 7 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
VLDB
2008
ACM
196views Database» more  VLDB 2008»
14 years 7 months ago
Modelling retrieval models in a probabilistic relational algebra with a new operator: the relational Bayes
This paper presents a probabilistic relational modelling (implementation) of the major probabilistic retrieval models. Such a high-level implementation is useful since it supports ...
Thomas Rölleke, Hengzhi Wu, Jun Wang, Hany Azzam