Results 31 to 40 of about 614,117 (293)
Interpreted Graphs and ETPR(k) Graph Grammar Parsing for Syntactic Pattern Recognition
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
Graph design by graph grammar evolution [PDF]
Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular optimization method, but scalability is a concern with larger graph designs. Generative representation schemes, often inspired by biological development, seek to address this by ...
Martin H. Luerssen, David M. W. Powers
openaire +2 more sources
Context-free path querying with all-path semantics using matrices with sets of intermediate vertices [PDF]
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
Parsing Graphs with Regular Graph Grammars [PDF]
Recently, several datasets have become available which represent natural language phenomena as graphs. Hyperedge Replacement Languages (HRL) have been the focus of much attention as a formalism to represent the graphs in these datasets. Chiang et al.
Gilroy, Sorcha +2 more
openaire +3 more sources
Graph parsing with s-graph grammars [PDF]
A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. computing all possible analyses of a given graph according to a grammar. This problem arises in training synchronous string-to-graph grammars, and when generating strings from them. We present two algorithms for graph parsing (bottom-up and top-down) with
Jonas Groschwitz +2 more
openaire +1 more source
Hypergrammar Based Parallel Multi-Frontal Solver For Grids With Point Singularities
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
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
A Demonstration of the Grrr Graph Rewriting Programming Language [PDF]
This paper overviews the graph rewriting programming language, Grrr. The serial graph rewriting strategy is detailed, and key elements of the user interface are described.
Rodgers, Peter, Vidal, Natalia
core +1 more source
A Solution to the Flowgraphs Case Study using Triple Graph Grammars and eMoflon [PDF]
After 20 years of Triple Graph Grammars (TGGs) and numerous actively maintained implementations, there is now a need for challenging examples and success stories to show that TGGs can be used for real-world bidirectional model transformations.
Anthony Anjorin, Marius Lauder
doaj +1 more source
Improving the graph grammar parser of Rekers and Schürr [PDF]
Graph grammars and graph grammar parsers are to visual languages what string grammars and parsers are to textual languages. A graph grammar specifies a set of valid graphs and can thus be used to formalise the syntax of a visual language. A graph grammar
Fürst, Luka +2 more
core +1 more source

