Sciweavers

11017 search results - page 10 / 2204
» Closure Systems and their Structure
Sort
View
TACAS
2009
Springer
115views Algorithms» more  TACAS 2009»
14 years 2 months ago
Iterating Octagons
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
Marius Bozga, Codruta Gîrlea, Radu Iosif
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
14 years 5 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
EBERNBURG
1990
13 years 11 months ago
Problems of Autonomy and Discontexturality in the Theory of Living Systems
In the theory of living systems any description of self-organizing processes is confronted by a very central problem concerning the role of the system's boundary, i.e., there...
Rudolf Kaehr, E. von Goldammer
ENTCS
2007
108views more  ENTCS 2007»
13 years 7 months ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig
EFDBS
2003
13 years 9 months ago
Four-Level-Architecture for Closure in Interoperability
A definition of types in an information system is given from ld abstractions through data constructs, schema and definitions to physical data values. Category theory suggests tha...
B. Nick Rossiter, Michael A. Heather