Sciweavers

4397 search results - page 191 / 880
» Relational Algebra Operations
Sort
View
79
Voted
ISSAC
1989
Springer
74views Mathematics» more  ISSAC 1989»
15 years 7 months ago
Lookup Tables, Recurrences and Complexity
The use of lookup tables can reduce the complexity of calculation of functions defined typically by mathematical recurrence relations. Although this technique has been adopted by...
Richard J. Fateman
106
Voted
EDBTW
2006
Springer
15 years 7 months ago
Models for Incomplete and Probabilistic Information
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite dom...
Todd J. Green, Val Tannen
131
Voted
MASCOTS
2003
15 years 4 months ago
PEPA Nets
Abstract. In this paper we describe a formalism which uses the stochastic process algebra PEPA as the inscription language for labelled stochastic Petri nets. Viewed in another way...
Stephen Gilmore, Jane Hillston, Leïla Kloul
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 3 months ago
Using groups for investigating rewrite systems
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...
Patrick Dehornoy
132
Voted
JUCS
2006
126views more  JUCS 2006»
15 years 3 months ago
Behavioral Institutions and Refinements in Generalized Hidden Logics
: We investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract alge...
Manuel A. Martins