- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Karlsruhe, Karlsruher Institut für Technologie (KIT), Dissertation, 2023
- Schlagwort
-
Netzwerk
Algorithmus
- Ereignis
-
Veröffentlichung
- (wo)
-
Karlsruhe
- (wer)
-
KIT-Bibliothek
- (wann)
-
2023
- Urheber
-
Weyand, Christopher
- Beteiligte Personen und Organisationen
-
Bläsius, Thomas
Meyer, Ulrich
- DOI
-
10.5445/IR/1000158520
- URN
-
urn:nbn:de:101:1-2023051004583055290925
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:52 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.
Beteiligte
- Weyand, Christopher
- Bläsius, Thomas
- Meyer, Ulrich
- KIT-Bibliothek
Entstanden
- 2023
Ähnliche Objekte (12)
Spatial Segmentation Algorithm for Stratified Random Sample considering geometric circumstances
Algorithm engineering in geometric network planning and data mining
Random geometric structures
Fine-grained complexity and algorithm engineering of geometric similarity measures
Special issue: algorithm engineering
1/3 Spectral vs. geometric approaches to random walks on random graphs
3/3 Spectral vs. geometric approaches to random walks on random graphs
2/3 Spectral vs. geometric approaches to random walks on random graphs
Xaver: Algorithm Engineering XXL : Endbericht
Geometric algebra with applications in engineering
A Central Limit Theorem for Functions on Weighted Sparse Inhomogeneous Random Graphs
On realistic random network models for algorithm evaluation
Spatial Segmentation Algorithm for Stratified Random Sample considering geometric circumstances
Algorithm engineering in geometric network planning and data mining
Random geometric structures
Fine-grained complexity and algorithm engineering of geometric similarity measures
Special issue: algorithm engineering
1/3 Spectral vs. geometric approaches to random walks on random graphs
3/3 Spectral vs. geometric approaches to random walks on random graphs
2/3 Spectral vs. geometric approaches to random walks on random graphs
Xaver: Algorithm Engineering XXL : Endbericht
Geometric algebra with applications in engineering
A Central Limit Theorem for Functions on Weighted Sparse Inhomogeneous Random Graphs
On realistic random network models for algorithm evaluation
Spatial Segmentation Algorithm for Stratified Random Sample considering geometric circumstances
Algorithm engineering in geometric network planning and data mining
Random geometric structures
Fine-grained complexity and algorithm engineering of geometric similarity measures
Special issue: algorithm engineering
1/3 Spectral vs. geometric approaches to random walks on random graphs
3/3 Spectral vs. geometric approaches to random walks on random graphs
2/3 Spectral vs. geometric approaches to random walks on random graphs
Xaver: Algorithm Engineering XXL : Endbericht
Geometric algebra with applications in engineering
A Central Limit Theorem for Functions on Weighted Sparse Inhomogeneous Random Graphs