Results 131 to 140 of about 86,434 (167)

Graph matching by configurational relaxation

Proceedings of the 12th IAPR International Conference on Pattern Recognition (Cat. No.94CH3440-5), 2002
This paper describes a symbolic approach to relational matching. The novelty of the method lies in its Bayesian modelling of relational consistency through the use of an explicit constraint corruption process. In consequence of this assumed model the consistency of match is gauged by a compound exponential function of a higher-order Hamming distance ...
R.C. Wilson, E.R. Hancock
openaire   +1 more source

Minimal configuration bicyclic graphs

Linear and Multilinear Algebra, 2012
The nullity η(G) of a graph G is the multiplicity of zero as an eigenvalue of the adjacency matrix of G. If η(G) = 1, then the core of G is the subgraph induced by the vertices associated with the nonzero entries of the kernel eigenvector. The set of vertices which are not in the core is the periphery of G.
openaire   +1 more source

Rematerializing Graphs: Learning Spatial Configuration

2022
In architecture, recent developments in machine learning technologies have reenergized the established research areas of generative design and design analysis. Proponents argue that data-driven systems can learn the implicit rules of architectural design for the generation of new designs or the incorporation into new methods of architectural research ...
openaire   +1 more source

D3.1– Knowledge Graph Configuration Manual & Deployment

2023
The D3.1- Knowledge Graph Configuration Manual & Deployment deliverable provides a comprehensive guide for configuring and deploying the EO4EU knowledge graph, emphasizing its importance in earth observations. It highlights the transformative role of knowledge graphs in facilitating data integration, interoperability, and decision-making, making earth ...
NVCR, Tsakalidis, Dimitris
openaire   +1 more source

Forest Fire Models on Configuration Random Graphs

Fundamenta Informaticae, 2016
We consider a random process of fire propagation over the links of the two configuration graphs with random node degrees. Node degrees follow either the power-law or the Poisson distribution. A comparative analysis of these graph models in terms of the number of nodes remaining after the fire was performed.
Leri, Marina, Pavlov, Yuri
openaire   +2 more sources

Propagating configuration decisions with modal implication graphs

Proceedings of the 40th International Conference on Software Engineering, 2018
This work was originally published as “Propagating Configuration Decisions with Modal Implication Graphs” at the 40th International Conference on Software Engineering 2018 [Kr18].
Krieter, Sebastian, Thüm, Thomas, Schulze, Sandro, Schroeter, Reimar, Saake, Gunter   +4 more
openaire   +1 more source

Graph Configurations and Decoding Performance

2001
The performance of a new method for decoding binary error correcting codes is presented, and compared with established hard and soft decision decoding methods. The new method uses a modified form of the maxsum algorithm, which is applied to a split (partially disconnected) modification of the Tanner graph of the code.
J. T. Paire, P. Coulton, P. G. Farrell
openaire   +1 more source

Ideal spatial graph configurations

Journal of Mathematics and the Arts, 2022
Stephen K. Lucas, Laura Taalman
openaire   +1 more source

Integral, Configural, and Unitary Graphs

Proceedings of the Human Factors Society Annual Meeting, 1988
Thirteen graphical formats, each designed to display two variables, were subjected to performance-based diagnostics of integrality, configurality, and perceptual unity. None of the graphs appeared to be composed of integral dimensions; however, several graphs were classified as unitary or configural. When graphical elements or dimensions were combined
openaire   +1 more source

Graph Products and Configuration Processing

2013
Graph products are defined and developed in the past 50 years (see, e.g. Berge [1], Sabidussi [2], Harary and Wilcox [3]). An excellent book covering the mathematics of graph products is that of Imrich and Klavzar [4]. In this chapter, the necessary definitions from graph products are presented and examples are included to illustrate the definitions ...
openaire   +1 more source