Sciweavers

1175 search results - page 40 / 235
» Abstract computability and algebraic specification
Sort
View
CADE
2007
Springer
14 years 8 months ago
Automated Reasoning in Kleene Algebra
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
Georg Struth, Peter Höfner
PAKDD
2005
ACM
96views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Kernels over Relational Algebra Structures
Abstract. In this paper we present a novel and general framework based on concepts of relational algebra for kernel-based learning over relational schema. We exploit the notion of ...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 7 months ago
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
Gábor Ivanyos, Marek Karpinski, Lajos R&oac...
ECOOPW
1998
Springer
13 years 12 months ago
A Rational Approach to Portable High Performance: The Basic Linear Algebra Instruction Set (BLAIS) and the Fixed Algorithm Size
Abstract. We introduce a collection of high performance kernels for basic linear algebra. The kernels encapsulate small xed size computations in order to provide building blocks fo...
Jeremy G. Siek, Andrew Lumsdaine
CONCUR
1998
Springer
13 years 12 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert