Camila F. Costa

Learn More
We consider the problem of finding the closest point of interest in road networks where the travel time along each edge is a function of the departure time and the service time of the facilities are taken into consideration. More specifically, our query aims to find the point of interest (e.g., a museum) in which the user can be served in the minimum amount(More)
In this paper we present an algorithm for optimal processing of time-dependent sequenced route queries in road networks, i.e., given a road network where the travel time over an edge is time-dependent and a given ordered list of categories of interest, we find the fastest route between an origin and destination that passes through a sequence of points of(More)
Advancements in mobile computing techniques along with the pervasiveness of location-based services have generated a great amount of trajectory data. These data can be used for various data analysis purposes such as traffic flow analysis, infrastructure planning and understanding of human behavior. However, publishing this amount of trajectory data may lead(More)
  • 1