On the public citation graph

Genetic search for structural matching

https://doi.org/10.1007/bfb0015562
0 signed · 48 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0031-3203(90)90094-2openalex-snapshot
Discrete relaxation
inferredcites →https://doi.org/10.1016/0262-8856(95)99728-jopenalex-snapshot
Relational matching by discrete relaxation
inferredcites →https://doi.org/10.1016/b978-0-444-81892-8.50019-5openalex-snapshot
Graph matching by discrete relaxation
inferredcites →https://doi.org/10.1109/34.16712openalex-snapshot
A renormalization group approach to image processing problems
inferredcites →https://doi.org/10.1109/72.265956openalex-snapshot
An introduction to simulated evolutionary optimization
inferredcites →https://doi.org/10.1109/72.265965openalex-snapshot
Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. Part I: Basic properties of selection and mutation
inferredcites →https://doi.org/10.1109/72.265966openalex-snapshot
Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. Part II: Analysis of the diversification role of crossover
inferredcites →https://doi.org/10.1109/72.661129openalex-snapshot
Comments on "Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. I. Basic properties of selection and mutation" [with reply]
inferredcites →https://doi.org/10.1109/iccv.1995.466905openalex-snapshot
Relational matching with dynamic graph structures
inferredcites →https://doi.org/10.1109/icnn.1988openalex-snapshot
IEEE 1988 International Conference on Neural Networks
inferredcites →https://doi.org/10.1109/icnn.1993.298580openalex-snapshot
A Bayesian interpretation for the Hopfield network
inferredcites →https://doi.org/10.1109/iscv.1995.477029openalex-snapshot
Relational matching with stochastic optimisation
inferredcites →https://doi.org/10.1109/tpami.1981.4767127openalex-snapshot
Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach
inferredcites →https://doi.org/10.1109/tpami.1984.4767596openalex-snapshot
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
inferredcites →https://doi.org/10.1109/tpami.1985.4767621openalex-snapshot
A Metric for Comparing Relational Descriptions
inferredcites →https://doi.org/10.1109/tpami.1985.4767707openalex-snapshot
Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
inferredcites →https://doi.org/10.1109/tsmc.1983.6313167openalex-snapshot
A distance measure between attributed relational graphs for pattern recognition
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1162/neco.1990.2.1.1openalex-snapshot
Generalized Deformable Models, Statistical Physics, and Matching Problems
inferredcites →https://doi.org/10.7551/mitpress/4931.003.0017openalex-snapshot
*13 Simulated Annealing and Boltzmann Machines

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/cviu.1997.0602openalex-snapshot
Image Analysis and Computer Vision: 1996
inferred← citeshttps://doi.org/10.1006/cviu.1997.0656openalex-snapshot
Structural Matching with Active Triangulations
inferred← citeshttps://doi.org/10.1007/11539902_6openalex-snapshot
Simulated Annealing Genetic Algorithm for Surface Intersection
inferred← citeshttps://doi.org/10.1007/3-540-45129-3_2openalex-snapshot
Recent Advances in Structural Pattern Recognition with Applications to Visual Form Analysis
inferred← citeshttps://doi.org/10.1007/3-540-61577-6_16openalex-snapshot
Inexact graph matching with genetic search
inferred← citeshttps://doi.org/10.1007/3-540-62909-2_85openalex-snapshot
Deterministic search strategies for relational graph matching
inferred← citeshttps://doi.org/10.1007/3-540-62909-2_90openalex-snapshot
Genetic algorithms for ambiguous labelling problems
inferred← citeshttps://doi.org/10.1007/3-540-62909-2_95openalex-snapshot
An expectation-maximisation approach to graph matching
inferred← citeshttps://doi.org/10.1007/3-540-63460-6_96openalex-snapshot
Multi-sensor fusion with Bayesian inference
inferred← citeshttps://doi.org/10.1007/3-540-70659-3_3openalex-snapshot
Graph-Based Methods for Vision: A Yorkist Manifesto
inferred← citeshttps://doi.org/10.1007/978-1-4615-4401-2_10openalex-snapshot
Graph Matching and Similarity
inferred← citeshttps://doi.org/10.1007/978-3-642-35567-7_84openalex-snapshot
Research of Medical Image Registration Based on RMI-SAPSO Algorithm
inferred← citeshttps://doi.org/10.1007/bfb0033223openalex-snapshot
Error-tolerant graph matching: A formal framework and algorithms
inferred← citeshttps://doi.org/10.1016/j.ins.2013.10.005openalex-snapshot
CoBAn: A context based model for data leakage prevention
inferred← citeshttps://doi.org/10.1016/j.patrec.2012.04.017openalex-snapshot
Faster subgraph isomorphism detection by well-founded total order indexing
inferred← citeshttps://doi.org/10.1016/s0031-3203(96)00123-9openalex-snapshot
Inexact graph matching using genetic search
inferred← citeshttps://doi.org/10.1016/s0031-3203(99)00080-1openalex-snapshot
Genetic algorithms for ambiguous labelling problems
inferred← citeshttps://doi.org/10.1016/s0167-8655(01)00173-8openalex-snapshot
Self-organizing map for clustering in the graph domain
inferred← citeshttps://doi.org/10.1016/s0167-8655(97)00117-7openalex-snapshot
Multiple graph matching with Bayesian inference
inferred← citeshttps://doi.org/10.1016/s1361-8415(01)80026-8openalex-snapshot
A survey of medical image registration
inferred← citeshttps://doi.org/10.1017/s0890060415000062openalex-snapshot
Interpretation-driven mapping: A framework for conducting search and rerepresentation in parallel for computational analogy in design
inferred← citeshttps://doi.org/10.1109/icpr.1996.547653openalex-snapshot
Genetic algorithms for free-form surface matching
inferred← citeshttps://doi.org/10.1109/icpr.2000.906030openalex-snapshot
Recent developments in graph matching
inferred← citeshttps://doi.org/10.1109/icpr.2000.906212openalex-snapshot
Efficient algorithms for matching attributed graphs and function-described graphs
inferred← citeshttps://doi.org/10.1109/icws.2006.37openalex-snapshot
Behavioral matchmaking for service retrieval
inferred← citeshttps://doi.org/10.1109/vecims.2007.4373943openalex-snapshot
A Force Feedback Virtual Simulator for Education and Training
inferred← citeshttps://doi.org/10.1145/1102256.1102288openalex-snapshot
Distributed genetic algorithm for subtraction radiography
inferred← citeshttps://doi.org/10.2312/vcbm/vcbm10/033-040openalex-snapshot
Graph Averaging as a Means to Compare Multichannel EEG Coherence Networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.