This work considers the problem of computing distances between structured objects such as undirected graphs, seen as probability distributions in a specific metric space. We consider a new transportation distance ( i.e. that minimizes a total cost of transporting probability masses) that unveils the geometric nature of the structured objects space.

Oct 28, 2024 · We present five algorithms tailored for solving the one-to-all min-transfers problem using tpp-graph: the Single Queue Algorithm, the No Queue Algorithm, the Multiple Queue Algorithm, the Priority Queue Algorithm and the Multiple Priority Queue Algorithm.

Map-matching algorithms integrate positioning data with spatial road network data (roadway centrelines) to identify the correct link on which a vehicle is travelling and to determine the location of a vehicle on a link.

Jun 1, 2010 · This poster presents a variation on a Dijkstra's Algorithm assignment that uses the Google Maps API [2] and highway routing data from the Clinched Highway Mapping (CHM) Project [3] that allows students to compute and display, in …

In this paper, we will use GIS and Dijkstra’s Algorithm to calculate the shortest path. The system is implemented using free and open source technologies including open source GIS tools. A prototype application is designed and implemented based on short distance bus routes in Yangon city bus routes. 1. INTRODUCTION.

This poster presents a variation on a Dijkstra's Algorithm assignment that uses the Google Maps API [2] and highway routing data from the Clinched Highway Mapping (CHM) Project [3] that...

utilization and applications are emphasized in sections 3 and 4, including a brief outline of the development of a mobile navigation application and a modi ed, optimized version of the shortest path algorithm suitable to be run on a mobile phone. …

intensively investigated over years, due to its extensive applications in graph theory, artificial intelligence, computer network and the design of transportation systems. The classic Dijkstra’s algorithm was designed to solve the single-source shortest path problem for a static graph.

The idea behind our approach is to learn two sets of ``anchors'' that constrain the flow of transport between a source and target distribution. In both theoretical and empirical studies, we show that LOT regularizes the rank of transport and makes it more robust to …

This course will survey important developments in data structures that have not (yet) worked their way into the standard computer science curriculum. The precise topics will depend on the interests and background of the course participants.