Results 271 to 280 of about 2,887,430 (312)

A novel algorithm for matching conceptual and related graphs

1995
This paper presents a new similarity metric and algorithm for situations represented as graphs. The metric is based on the concept of shared information, and there is discussion of how this would apply for different forms of similarity—including surface, structural and thematic similarity.
Jonathan Poole, J. A. Campbell
openaire   +2 more sources

Conceptual graph matching: a flexible algorithm and experiments

Journal of Experimental & Theoretical Artificial Intelligence, 1992
Abstract Graph matching is recognized as a central problem across a variety of application areas, and application-specific matchers have been developed with different simplifying assumptions to reduce the computational complexity. Graph matching is viewed as a form of plausible reasoning when conceptual information contained in graphs are considered ...
Sung H. Myaeng, Aurelio López-López
openaire   +1 more source

Conceptual Overview of Algorithms

2019
The conceptual developments of x-ray dose calculation algorithms followed an evolutionary progression that mirrors what led to a deeper understanding of visible light. For higher megavoltage energies, photon scattering was less prevalent but electron ranges were longer and could disrupt equilibrium inside the body.
openaire   +1 more source

Conceptual graphs isomorphism: Algorithm and use

1996
The isomorphism problem is neither known to be NP-complete nor polynomial. Yet it is crucial for managing large conceptual graph sets. In order to speed up the conceptual graph isomorphism test, we associate to graphs a textual code that is invariant under isomorphism: a structural or filtering code. The structural code of a given graph is based on the
openaire   +1 more source

Conceptualizing Algorithmic Stigmatization

Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems, 2023
Nazanin Andalibi, Cassidy Pyle, Kristen Barta, Lu Xian, Abigail Z. Jacobs, Mark S. Ackerman   +5 more
openaire   +1 more source

Characterization and algorithmic recognition of canonical conceptual graphs

1993
This paper studies canonical graphs, which are conceptual graphs derivable from a canonical basis. We provide several characterizations of canonical graphs and prove that the correspondence between notions of a projection and a derivation sequence (specialization) holds true for canonical graphs.
Marie-Laure Mugnier, Michel Chein
openaire   +2 more sources

CGMA: A novel conceptual graph matching algorithm

1993
A novel Conceptual Graph Matching Algorithm (CGMA) is proposed along with a knowledge base organization scheme. It allows the user to select the Degree of Matching and Degree of Inheritance to increase the user's satisfaction. A conceptual graph is represented in a special linear form (called U-Form) for CGMA.
Gi-Chul Yang, Young Bae Choi, Jonathan C. Oh   +2 more
openaire   +1 more source

Conceptual visual human algorithms: requirement-driven skiing algorithm design

Proceedings of CG International '96, 2002
As the key visual display- and processing- element of information super highway nodes, computer graphics is advancing into dynamic and higher dimensional visual worlds. So is visual algorithms to program visual worlds as the contents of information super highways.
openaire   +2 more sources

The Application of Genetic Algorithms to Conceptual Design

1996
Design is not a simple hierarchical process where the designer is presented with a set of requirements and works steadily through a decomposition strategy moving from abstract concepts to the final concrete product. The design problem is ill-defined and changes as the designer explores it through solutions and partial solutions.
M G Hudson, I C Parmee
openaire   +1 more source

DynamicWEB: A Conceptual Clustering Algorithm for a Changing World

2011
This research was motivated by problems in network security, where an attacker often deliberately changes their identifying information and behaviour in order to camouflage their malicious behaviour. Addressing this problem has resulted in a new adaption to the unsupervised machine learning technique COBWEB.
openaire   +1 more source