Sciweavers

4397 search results - page 35 / 880
» Relational Algebra Operations
Sort
View
LICS
2000
IEEE
14 years 18 hour ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
13 years 11 months ago
An extensible test framework for the Microsoft StreamInsight query processor
Microsoft StreamInsight (StreamInsight, for brevity) is a platform for developing and deploying streaming applications. StreamInsight adopts a deterministic stream model that leve...
Alex Raizman, Asvin Ananthanarayan, Anton Kirilov,...
PR
2000
116views more  PR 2000»
13 years 7 months ago
On links between mathematical morphology and rough sets
Based on the observation that rough sets and mathematical morphology are both using dual operators sharing similar properties, we investigate more closely the links existing betwe...
Isabelle Bloch
RELMICS
1997
Springer
13 years 11 months ago
Relational Matching for Graphical Calculi of Relations
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
Wolfram Kahl
CALCO
2005
Springer
98views Mathematics» more  CALCO 2005»
14 years 1 months ago
The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this pa...
Bartek Klin