Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
As the complexity of nowadays systems continues to grow, we are moving away from creating individual components from scratch, toward methodologies that emphasize composition of re...
Radu Marculescu, Jan M. Rabaey, Alberto L. Sangiov...
We consider the problem of query optimization in distributed stream based systems where multiple continuous queries may be executing simultaneously. In such systems, distribution ...
Sangeetha Seshadri, Vibhore Kumar, Brian F. Cooper
In this paper, still images are modeled by hierarchical tree structures and object relational graphs. These modeling concepts can be described naturally using XML schema. We intro...