Hochschulschrift
Fine-grained complexity analysis of some combinatorial data science problems
- Weitere Titel
-
Detaillierte Komplexitätsanalyse einiger Kombinatorischer Data-Science-Probleme
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Berlin, Technische Universität Berlin, Dissertation, 2018
- Erschienen in
-
Foundations of computing ; 12
- Schlagwort
-
NP-hartes Problem
Berechnungskomplexität
Polynomialzeitalgorithmus
Projektive Geometrie
Visualisierung
Data Mining
Cluster
Maschinelles Lernen
Zeitreihenanalyse
Science
Hardness
Computational complexity
Triangle
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Universitätsverlag der TU Berlin
- (wann)
-
2018
- Urheber
- Beteiligte Personen und Organisationen
-
Niedermeier, Rolf
Niedermeier, Rolf
Friedrich, Tobias
Cygan, Marek
- DOI
-
10.14279/depositonce-7123
- Handle
-
11303/7961
- URN
-
urn:nbn:de:101:1-2018101702004553735214
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.20252025, 13:51 MEZ
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.
Objekttyp
- Hochschulschrift
Beteiligte
- Froese, Vincent
- Niedermeier, Rolf
- Friedrich, Tobias
- Cygan, Marek
- Universitätsverlag der TU Berlin
Entstanden
- 2018
Ähnliche Objekte (12)
Fine-grained complexity analysis of some combinatorial data science problems
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Fine-grained complexity and algorithm engineering of geometric similarity measures
How to emulate fine-grained multithreading
Fine-Grained Workflow Interoperability in Life Sciences
The case for fine-grained stream provenance
Fine-grained Distributed Application Monitoring Using LTTng
Distributed representations for fine-grained entity typing
Fine‐Grained Memory Profiling of GPGPU Kernels
Fine-grained Position Analysis for Political Texts
Fine-grained OS Control over High-performance Networking
Fine-grained complexity analysis of some combinatorial data science problems
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Fine-grained complexity and algorithm engineering of geometric similarity measures
How to emulate fine-grained multithreading
Fine-Grained Workflow Interoperability in Life Sciences
The case for fine-grained stream provenance
Fine-grained Distributed Application Monitoring Using LTTng
Distributed representations for fine-grained entity typing
Fine‐Grained Memory Profiling of GPGPU Kernels
Fine-grained Position Analysis for Political Texts
Fine-grained OS Control over High-performance Networking
Fine-grained complexity analysis of some combinatorial data science problems
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Fine-grained complexity and algorithm engineering of geometric similarity measures
How to emulate fine-grained multithreading
Fine-Grained Workflow Interoperability in Life Sciences
The case for fine-grained stream provenance
Fine-grained Distributed Application Monitoring Using LTTng
Distributed representations for fine-grained entity typing
Fine‐Grained Memory Profiling of GPGPU Kernels
Fine-grained Position Analysis for Political Texts