Results 21 to 30 of about 755,977 (295)

Component-based Systems Reconfigurations Using Graph Grammars

open access: yesМоделирование и анализ информационных систем, 2016
Dynamic reconfigurations can modify the architecture of component-based systems without incurring any system downtime. In this context, the main contribution of the present article is the establishment of correctness results proving component-based ...
O. Kouchnarenko, J.-F. Weber
doaj   +1 more source

Tree-Verifiable Graph Grammars [PDF]

open access: yes
Hyperedge-Replacement grammars (HR) have been introduced by Courcelle in order to extend the notion of context-free sets from words and trees to graphs of bounded tree-width.
Chimes, Mark   +2 more
core   +4 more sources

Ordered Tree Decomposition for HRG Rule Extraction [PDF]

open access: yesComputational Linguistics, 2019
We present algorithms for extracting Hyperedge Replacement Grammar (HRG) rules from a graph along with a vertex order. Our algorithms are based on finding a tree decomposition of smallest width, relative to the vertex order, and then extracting one rule ...
Daniel Gildea   +2 more
doaj   +1 more source

Navigating the Chemical Space of HCN Polymerization and Hydrolysis: Guiding Graph Grammars by Mass Spectrometry Data

open access: yesEntropy, 2013
Polymers of hydrogen cyanide and their hydrolysis products constitute a plausible, but still poorly understood proposal for early prebiotic chemistry on Earth.
Peter F. Stadler   +5 more
doaj   +1 more source

Interpreted Graphs and ETPR(k) Graph Grammar Parsing for Syntactic Pattern Recognition

open access: yesMachine Graphics & Vision, 2018
Further results of research into graph grammar parsing for syntactic pattern recognition (Pattern Recognit. 21:623-629, 1988; 23:765-774, 1990; 24:1223-1224, 1991; 26:1-16, 1993; 43:249-2264, 2010; Comput. Vision Graph. Image Process.
Mariusz Flasiński
doaj   +1 more source

Context-free path querying with all-path semantics using matrices with sets of intermediate vertices [PDF]

open access: yesНаучно-технический вестник информационных технологий, механики и оптики, 2021
The study considers the problem of context-free path querying with all-path query semantics. This problem consists in finding all paths of the graph, the labels on the edges of which form words from the language generated by the input context-free ...
Rustam Sh. Azimov, Semyon V. Grigorev
doaj   +1 more source

Hypergrammar Based Parallel Multi-Frontal Solver For Grids With Point Singularities

open access: yesComputer Science, 2015
This paper describes the application of hypergraph grammars to drive linear computationalcost solver for grids with point singularities. Such graph grammar productions are the rstmathematical formalism used to describe solver algorithm and each of them ...
Piotr Gurgul   +2 more
doaj   +1 more source

FAIR and Interactive Data Graphics from a Scientific Knowledge Graph

open access: yesScientific Data, 2022
Graph databases capture richly linked domain knowledge by integrating heterogeneous data and metadata into a unified representation. Here, we present the use of bespoke, interactive data graphics (bar charts, scatter plots, etc.) for visual exploration ...
Michael E. Deagen   +6 more
doaj   +1 more source

Nested Term Graphs (Work In Progress) [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2015
We report on work in progress on 'nested term graphs' for formalizing higher-order terms (e.g. finite or infinite lambda-terms), including those expressing recursion (e.g. terms in the lambda-calculus with letrec).
Clemens Grabmayer, Vincent van Oostrom
doaj   +1 more source

An Event Structure Semantics for Graph Grammars with Parallel Productions

open access: yes, 1996
We propose a truly concurrent semantics for graph grammars, based on event structures, that generalizes to arbitrary consuming grammars (i.e., such that each production deletes some items) the semantics presented in [4] for the subclass of safe grammars.
MONTANARI, UGO GIOVANNI ERASMO   +9 more
core   +1 more source

Home - About - Disclaimer - Privacy