Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Judith Hermanns"'
Autor:
Judith Hermanns, Konstantinos Skitsas, Anton Tsitsulin, Marina Munkhoeva, Alexander Kyster, Simon Nielsen, Alexander M. Bronstein, Davide Mottin, Panagiotis Karras
Publikováno v:
Hermanns, J, Skitsas, K, Tsitsulin, A, Munkhoeva, M, Kyster, A, Nielsen, S, Bronstein, A M, Mottin, D & Karras, P 2023, ' GRASP : Scalable Graph Alignment by Spectral Corresponding Functions ', ACM Transactions on Knowledge Discovery from Data, vol. 17, no. 4, 50, pp. 1-26 . https://doi.org/10.1145/3561058
What is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinformatics. Some solutions assume that auxiliary information on known mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a96560806da5ceae4d2bc82fe37624c
https://doi.org/10.1145/3561058
https://doi.org/10.1145/3561058
Autor:
Davide Mottin, Alexander Frederiksen Kyster, Panagiotis Karras, Judith Hermanns, Simon Daugaard Nielsen
Publikováno v:
CIKM
Kyster, A F, Nielsen, S D, Hermanns, J, Mottin, D & Karras, P 2021, Boosting Graph Alignment Algorithms . in Proceedings of the 30th ACM International Conference on Information & Knowledge Management (CIKM '21) . Association for Computing Machinery, New York, pp. 3166-3170, 30th ACM International Conference on Information and Knowledge Management, CIKM 2021, Virtual, Online, Australia, 01/11/2021 . https://doi.org/10.1145/3459637.3482067
Kyster, A F, Nielsen, S D, Hermanns, J, Mottin, D & Karras, P 2021, Boosting Graph Alignment Algorithms . in Proceedings of the 30th ACM International Conference on Information & Knowledge Management (CIKM '21) . Association for Computing Machinery, New York, pp. 3166-3170, 30th ACM International Conference on Information and Knowledge Management, CIKM 2021, Virtual, Online, Australia, 01/11/2021 . https://doi.org/10.1145/3459637.3482067
The problem of graph alignment is to find corresponding nodes between a pair of graphs. Past work has treated the problem in a monolithic fashion, with the graph as input and the alignment as output, offering limited opportunities to adapt the algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8a656c62b35e7571b16f67b94d94e56f
https://doi.org/10.1145/3459637.3482067
https://doi.org/10.1145/3459637.3482067
Autor:
Judith Hermanns, Panagiotis Karras, Davide Mottin, Alexander M. Bronstein, Anton Tsitsulin, Marina Munkhoeva
Publikováno v:
Web and Big Data ISBN: 9783030858957
APWeb/WAIM (1)
APWeb/WAIM (1)
What is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinformatics. Existing solutions either require auxiliary information such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff2b0d72be6edd781847b03a8357e238
https://doi.org/10.1007/978-3-030-85896-4_4
https://doi.org/10.1007/978-3-030-85896-4_4
Publikováno v:
CIKM
With the continuous rise of multimedia, the question of how to access large-scale multimedia databases efficiently has become of crucial importance. Given a multimedia database comprising millions of multimedia objects, how to approximate the content
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6d67faa9dbd63a0e387234c46e8f050
https://doi.org/10.1145/2806416.2806459
https://doi.org/10.1145/2806416.2806459