Marco Polo's travels revisited : from motion event detection to optimal path computation in 3D maps
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Digital humanities 2023 : Book of abstracts. S. 357-359
- Klassifikation
-
Geografie, Reisen
- Ereignis
-
Veröffentlichung
- (wo)
-
Leipzig
- (wer)
-
Universitätsbibliothek Leipzig
- (wann)
-
2024
- Urheber
-
Niekler, Andreas
Wolska, Magdalena
Wiegmann, Matti
Stein, Benno
Burghardt, Manuel
Thiel, Marvin
- URN
-
urn:nbn:de:bsz:15-qucosa2-925713
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:59 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
- Niekler, Andreas
- Wolska, Magdalena
- Wiegmann, Matti
- Stein, Benno
- Burghardt, Manuel
- Thiel, Marvin
- Universitätsbibliothek Leipzig
Entstanden
- 2024
Ähnliche Objekte (12)
Distributed shortest-path computation
Acceleration of Shortest Path and Constrained Shortest Path Computation
Fast SVM regularization path computation : theory and implementation
Gulliver's travels and Ching-hua-yuan revisited : a Menippean approach
Evolutionary computation for unmanned aerial vehicle path planning: a survey
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Travels.
Travels.
Travels
Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation
StringENT test suite: ENT battery revisited for efficient P value computation
A THEORETICAL PATH COMPUTATION MODEL FOR RECTANGULAR RIGID-BODIES ENTERING AN ENTRANCE
Distributed shortest-path computation
Acceleration of Shortest Path and Constrained Shortest Path Computation
Fast SVM regularization path computation : theory and implementation
Gulliver's travels and Ching-hua-yuan revisited : a Menippean approach
Evolutionary computation for unmanned aerial vehicle path planning: a survey
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Travels.
Travels.
Travels
Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation
StringENT test suite: ENT battery revisited for efficient P value computation
A THEORETICAL PATH COMPUTATION MODEL FOR RECTANGULAR RIGID-BODIES ENTERING AN ENTRANCE
Distributed shortest-path computation
Acceleration of Shortest Path and Constrained Shortest Path Computation
Fast SVM regularization path computation : theory and implementation
Gulliver's travels and Ching-hua-yuan revisited : a Menippean approach
Evolutionary computation for unmanned aerial vehicle path planning: a survey
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Travels.
Travels.
Travels
Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation
StringENT test suite: ENT battery revisited for efficient P value computation