- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2096-0662
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Creator
-
Chen, Renjie
Gotsman, Craig
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s41095-021-0211-2
- URN
-
urn:nbn:de:101:1-2021060619221511403109
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:01 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Chen, Renjie
- Gotsman, Craig
- SpringerLink (Online service)
Other Objects (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
Precise and efficient parametric path analysis
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
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
Precise and efficient parametric path analysis
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
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
Precise and efficient parametric path analysis
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