In this work, we present three classes of methods to extract information from triangulated
mobile phone signals, and describe applications with different goals in spatiotemporal …

A time-dependent graph is, informally speaking, a graph structure dynamically changes with
time. In such graphs, the weights associated with edges dynamically change over time, that …

One crucial task in intelligent transportation systems is estimating the duration of a potential
trip given the origin location, destination location as well as the departure time. Most existing …

A shortest-path algorithm finds a path containing the minimal cost between two vertices in a
graph. A plethora of shortest-path algorithms is studied in the literature that span across …

For the first time, real-time high-fidelity spatiotemporal data on transportation networks of
major cities have become available. This gold mine of data can be utilized to learn about …

Location-based services (LBS) have been significantly developed and widely deployed in
mobile devices. It is also well-known that LBS applications may result in severe privacy …

For real-world time dependent road networks (TDRNs), answering shortest path-based route
queries and plans in real-time is highly desirable by many industrial applications …

For thousands of years, people have been innovating new technologies to make their travel
faster, the latest of which is GPS technology that is used by millions of drivers every day. The …

On time-dependent graphs, fastest path query is an important problem and has been well
studied. It focuses on minimizing the total travel time (waiting time+ on-road time) but does …

In this paper, we study the Time-Dependent k Nearest Neighbor (TD-k NN) query on moving
objects that aims to return k objects arriving at the query location with the least traveling cost …