Abstract The Graph Edit Distance (GED) problem is a very interesting problem that relates to
Graph Matching (GM) problems, wherever a graph models a problem-defined pattern …

Graph-based representations are experiencing a growing usage in visual recognition and
retrieval due to their representational power in front of classical appearance-based …

Traditional intrusion detection systems (IDSs) and intrusion prevention systems (IPSs) focus
on detecting, preventing, and blocking known attacks and obvious threats. Contrary to these …

Dans cet article, nous proposons une méthode d'appproximation de la distance d'édition
entre graphes basée sur l'utilisation de deux techniques récentes d'apprentissage profond …

Le problème de Graph Matching permet, entre autres, de reconnaitre des formes ou des
objets. C'est un problème complexe pour lequel de nombreuses méthodes de résolution ont …

Although theorised about fifteen years ago, the scientific community's interest for graph
neural networks has only really taken off recently. Those models aim to transpose the …

Software homology detection is very meaningful for software copyright protection and
malicious code variants detection. In this paper, we propose a genetic algorithm to justify the …

Graph-based representations are experiencing a growing usage in visual recognition and
retrieval due to their representational power in front of classical appearance-based …

The recent computerization of cars, together with the development of sensor technologies
and car communication devices have revolutionized the way researchers and analysts deal …