Sciweavers

328 search results - page 37 / 66
» Graph Algebras for Bigraphs
Sort
View
SIGSOFT
2001
ACM
14 years 8 months ago
A graph based architectural (Re)configuration language
For several different reasons, such as changes in the business or technological environment, the configuration of a system may need to evolve during execution. Support for such ev...
Michel Wermelinger, Antónia Lopes, Jos&eacu...
ISSAC
2007
Springer
121views Mathematics» more  ISSAC 2007»
14 years 1 months ago
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...
Eric Robinson, Daniel Kunkle, Gene Cooperman
ICDE
2007
IEEE
89views Database» more  ICDE 2007»
13 years 11 months ago
A Flexible Query Graph Based Model for the Efficient Execution of Continuous Queries
In this paper, we propose a simple and flexible execution model that (i) supports a wide spectrum of alternative optimization and execution strategies and their mixtures, (ii) pro...
Yijian Bai, Hetal Thakkar, Haixun Wang, Carlo Zani...
DAGSTUHL
2008
13 years 9 months ago
Constraint Satisfaction Problems with Infinite Templates
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
Manuel Bodirsky
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
14 years 2 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...