Vehicular crowdsensing (VCS) within the social Internet of Vehicles (IoV) significantly
advances urban transportation management by enhancing road safety, traffic efficiency, and …

Shortest path computation is a fundamental operation of many applications in small-world
networks, and shortest path index has been extensively studied to achieve high query …

The Constrained Shortest Path (CSP) problem seeks to identify the shortest path between
two vertices in a road network while adhering to a specific constraint on another criterion …

Facial image restoration has gained a tremendous progress since the increasing boom of
the deep learning methods. Owing to its nature of strong ill-posedness, different categories …

Travel planning plays an increasingly important role in our society. The travel plans, which
consist of the paths each vehicle is suggested to follow and its corresponding departure …

In this paper, we revisit the problem of the current routing system in terms of prediction
scalability and routing result optimality. Specifically, the current traffic prediction models are …

Shortest path (SP) computation is the building block for many location-based services, and
achieving high throughput SP query processing is an essential goal for the real-time …

Landmark-based 3-hop cover labeling is a category of approaches for shortest distance/path
queries on large-scale complex networks. It pre-computes an index offline to accelerate the …

The routing results are playing an increasingly important role in transportation efficiency, but
they could generate traffic congestion unintentionally. This is because the traffic condition …

Graph partitioning is a common solution to scale up the graph algorithms, and shortest path
(SP) computation is one of them. However, the existing solutions typically have a fixed …