Sciweavers

1153 search results - page 74 / 231
» Reversing graph transformations
Sort
View
CORR
2007
Springer
87views Education» more  CORR 2007»
13 years 10 months ago
Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
Animashree Anandkumar, Lang Tong, Ananthram Swami
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
14 years 2 months ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...
DEXAW
2009
IEEE
114views Database» more  DEXAW 2009»
14 years 1 months ago
A Meta-Framework for Generating Ontologies from Legacy Schemas
A huge amount of schemas are expressed within outdated schema languages which are restricted concerning expressiveness, extensibility, readability, and understandability. Consequen...
Manuel Wimmer
ICALP
2000
Springer
14 years 1 months ago
Amalgamation of Transition Sequences in the PEPA Formalism
This report presents a formal approach to reducing sequences in PEPA components. Performing the described amalgamation procedure we may remove, from the underlying Markov chain, t...
Jane Hillston, J. Tomasik
JCSS
2002
95views more  JCSS 2002»
13 years 9 months ago
Efficient algorithms for multichromosomal genome rearrangements
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
Glenn Tesler