Katalog der Deutschen Nationalbibliothek

Neuigkeiten

Leichte Bedienung, intuitive Suche: Die Betaversion unseres neuen Katalogs ist online! → Zur Betaversion des neuen DNB-Katalogs

 
 
 


Ergebnis der Suche nach: tit all "Matching Algorithms"
im Bestand: Gesamter Bestand

21 - 30 von 239
<< < > >>


Artikel 21 On Using Proportional Representation Methods as Alternatives to Pro-rata Based Order Matching Algorithms in Stock Exchanges
Enthalten in Computational economics 21.3.2024: 1-20
Online Ressource
Artikel 22 A new hybrid strategy in medical image registration based on graph transformation matching and mean-based RANSAC algorithms
Enthalten in Multimedia tools and applications 12.3.2024: 1-28
Online Ressource
Artikel 23 Exact-matching algorithms using administrative health claims database equivalence factors for real-world data analysis based on the target trial emulation framework
Enthalten in Health services and outcomes research methodology 2.2.2024: 1-13
Online Ressource
Online Ressourcen 24 An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs
Dürr, Anita. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Online Ressource
Online Ressourcen 25 Approximation Algorithms for the Longest Run Subsequence Problem
Asahiro, Yuichi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Online Ressource
Online Ressourcen 26 Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications
Gabory, Esteban. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Online Ressource
Online Ressourcen 27 Engineering Fast Algorithms for the Bottleneck Matching Problem
Panagiotas, Ioannis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Online Ressource
Online Ressourcen 28 Exact Matching: Algorithms and Related Problems
El Maalouly, Nicolas El. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Online Ressource
Online Ressourcen 29 Exact Matching: Correct Parity and FPT Parameterized by Independence Number
El Maalouly, Nicolas El. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Online Ressource
Online Ressourcen 30 Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor
Boneh, Itai. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Online Ressource


21 - 30 von 239
<< < > >>


E-Mail-IconAdministration