Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Darwiche, Mostafa"'
Autor:
Darwiche, Mostafa
Cette thèse se situe à l’intersection de deux domaines de recherche scientifique la Reconnaissance d’Objets Structurels (ROS) et la Recherche Opérationnelle (RO). Le premier consiste à rendre la machine plus intelligente et à reconnaître le
Externí odkaz:
http://www.theses.fr/2018TOUR4022/document
Publikováno v:
In Computers and Operations Research June 2019 106:225-235
Publikováno v:
In Pattern Recognition Letters June 2020 134:20-28
Publikováno v:
ROADEF19
ROADEF19, Feb 2019, Le Havre, France
ROADEF19, Feb 2019, Le Havre, France
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::cd5f4b14a5af091ea110a7942e120d58
https://hal.archives-ouvertes.fr/hal-02077682/file/LocBra_VPLS_ROADEF2019_V3.pdf
https://hal.archives-ouvertes.fr/hal-02077682/file/LocBra_VPLS_ROADEF2019_V3.pdf
Publikováno v:
ISCO18
ISCO18, Apr 2018, Marrakesh, Morocco. pp.254-265
ISCO18, Apr 2018, Marrakesh, Morocco. pp.254-265
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::02d00f60f1b938770492d243a16822e1
https://hal.archives-ouvertes.fr/hal-01717268/file/2018ISCO.pdf
https://hal.archives-ouvertes.fr/hal-01717268/file/2018ISCO.pdf
Publikováno v:
ROADEF18
ROADEF18, Feb 2018, Lorient, France
ROADEF18, Feb 2018, Lorient, France
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::32f27b9f373136ad5d539d6f71313340
https://hal.archives-ouvertes.fr/hal-01717264
https://hal.archives-ouvertes.fr/hal-01717264
Publikováno v:
Matheuristics 2018
Matheuristics 2018, Jun 2018, Tours, France
Matheuristics 2018, Jun 2018, Tours, France
International audience; The Graph Edit Distance (GED) problem is a well-known graph matching problem. Solving the GED problem implies minimizing a dissimilarity measure between graphs that normally represent objects and patterns. It is known to be ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::458a5759f6a09c1c664433f0675b36cd
https://hal.science/hal-01717709
https://hal.science/hal-01717709
Publikováno v:
ROADEF2017
ROADEF2017, Feb 2017, Metz, France
ROADEF2017, Feb 2017, Metz, France
International audience; Les représentations structurelles et surtout celles qui se basent sur les graphes deviennent de plus en plus populaires dans plusieurs domaines connexes à la Recherche Opérationnelle (RO) comme la vision par ordinateur, la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::756b305587a6331f4f7d1903e0d242a2
https://hal.science/hal-01564064
https://hal.science/hal-01564064
Publikováno v:
MIC17 12th Metaheuristics International Conference
MIC17 12th Metaheuristics International Conference, Jul 2017, Barcelona, Spain
MIC17 12th Metaheuristics International Conference, Jul 2017, Barcelona, Spain
International audience; The Graph Edit Distance (GED) is a well-known problem to match graphs. Solving the GED problem allows computing a dissimilarity measure between graphs that normally represent objects and patterns. It is known to be very flexib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::94d015ca3576fa61db577fcce63de81b
https://hal.science/hal-01564079
https://hal.science/hal-01564079
Autor:
Darwiche, Mostafa
This thesis is focused on Graph Matching (GM) problems and in particular the Graph Edit Distance (GED) problems. There is a growing interest in these problems due to their numerous applications in different research domains, e.g. biology, chemistry,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::598e942130c7e37c34aab83404a493e5
https://hal.science/tel-03576011
https://hal.science/tel-03576011