|
411 |
Comparing linear discriminant analysis and supervised learning algorithms for binary classification - a method comparison study
Graf, Ricarda. - Augsburg : Universität Augsburg, 2024
|
|
|
|
412 |
Comparing machine learning algorithms by union-free generic depth
Blocher, Hannah. - Ludwig-Maximilians-Universität München, 2024
|
|
|
|
413 |
Competitive Capacitated Online Recoloring
Rajaraman, Rajmohan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
414 |
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
Bampis, Evripidis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
415 |
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs
Lozin, Vadim. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
416 |
Complexity of Local Search for Euclidean Clustering Problems
Manthey, Bodo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
417 |
Composition Orderings for Linear Functions and Matrix Multiplication Orderings
Kubo, Susumu. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
418 |
Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models
Banderier, Cyril. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
419 |
Computational Assessment of Spectral Heterogeneity within Fresh Glioblastoma Tissue Using Raman Spectroscopy and Machine Learning Algorithms
Klein, Karoline. - Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2024
|
|
|
|
420 |
Computational Complexity of Matching Match Puzzle
Iburi, Yuki. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
