- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2096-0662
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Efficient fastest-path computations for road maps ; volume:7 ; number:2 ; day:1 ; month:4 ; year:2021 ; pages:267-281 ; date:6.2021
Computational Visual Media ; 7, Heft 2 (1.4.2021), 267-281, 6.2021
- Urheber
-
Chen, Renjie
Gotsman, Craig
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s41095-021-0211-2
- URN
-
urn:nbn:de:101:1-2021060619221511403109
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:01 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
- Chen, Renjie
- Gotsman, Craig
- SpringerLink (Online service)
Ähnliche Objekte (12)
Efficient path-based computations on pedigree graphs with compact encodings
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Efficient and private computations with code-based masking
Software project "miraculix": Efficient computations with large genomic datasets
Multipoint identity-by-descent computations for single-point polymorphism and microsatellite maps
Persistent Computations
Accurate and efficient boundary integral computations for interfacial flow with surfactant
An efficient algorithm for numerical computations of continuous densities of states
Energy- and cost-efficient Lattice-QCD computations using graphics processing units
Precise and efficient parametric path analysis
Hardware-Software Co-Design for Efficient Graph Application Computations on Emerging Architectures
Efficient path-based computations on pedigree graphs with compact encodings
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Efficient and private computations with code-based masking
Software project "miraculix": Efficient computations with large genomic datasets
Multipoint identity-by-descent computations for single-point polymorphism and microsatellite maps
Persistent Computations
Accurate and efficient boundary integral computations for interfacial flow with surfactant
An efficient algorithm for numerical computations of continuous densities of states
Energy- and cost-efficient Lattice-QCD computations using graphics processing units
Precise and efficient parametric path analysis
Hardware-Software Co-Design for Efficient Graph Application Computations on Emerging Architectures
Efficient path-based computations on pedigree graphs with compact encodings
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Efficient and private computations with code-based masking
Software project "miraculix": Efficient computations with large genomic datasets
Multipoint identity-by-descent computations for single-point polymorphism and microsatellite maps
Persistent Computations
Accurate and efficient boundary integral computations for interfacial flow with surfactant
An efficient algorithm for numerical computations of continuous densities of states
Energy- and cost-efficient Lattice-QCD computations using graphics processing units
Precise and efficient parametric path analysis