- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2524-4914
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Computing graph edit distance on quantum devices ; volume:4 ; number:2 ; day:26 ; month:8 ; year:2022 ; pages:1-21 ; date:12.2022
Quantum machine intelligence ; 4, Heft 2 (26.8.2022), 1-21, 12.2022
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s42484-022-00077-x
- URN
-
urn:nbn:de:101:1-2022111309340453399456
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:29 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Incudini, Massimiliano
- Tarocco, Fabio
- Mengoni, Riccardo
- Di Pierro, Alessandra
- Mandarino, Antonio
- SpringerLink (Online service)
Ähnliche Objekte (12)
Redefining the Graph Edit Distance
The Reeb Graph Edit Distance is Universal
On Computing Medians of Marked Point Process Data Under Edit Distance
Exact and heuristic algorithms for network alignment using graph edit distance models
Distance-regular graphs
Quantitative monitoring of STL with edit distance
Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Embedding edit distance to enable private keyword search
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
Secure approximation of edit distance on genomic data
Redefining the Graph Edit Distance
The Reeb Graph Edit Distance is Universal
On Computing Medians of Marked Point Process Data Under Edit Distance
Exact and heuristic algorithms for network alignment using graph edit distance models
Distance-regular graphs
Quantitative monitoring of STL with edit distance
Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Embedding edit distance to enable private keyword search
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
Secure approximation of edit distance on genomic data
Redefining the Graph Edit Distance
The Reeb Graph Edit Distance is Universal
On Computing Medians of Marked Point Process Data Under Edit Distance
Exact and heuristic algorithms for network alignment using graph edit distance models
Distance-regular graphs
Quantitative monitoring of STL with edit distance
Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Embedding edit distance to enable private keyword search
k-Approximate Quasiperiodicity Under Hamming and Edit Distance