Searching for authors named "Evangelos Kanoulas" – sorted by Relevance.
-
Finding fastest paths on a road network with speed patterns
- This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP asks for a set of all fastest paths from s to e, one for each sub-interval of I. Note that the query algorithm should fin
- Cited by 2 (0 self) – Add To MetaCart
-
On Computing Top-t Most Influential Spatial Sites
- Given a set O of weighted objects, a set S of sites, and a query site s, the bichromatic RNN query computes the influence set of s, or the set of objects in O that consider s as the nearest site among all sites in S. The influence of a site s can be defined as the total weight of its RNNs. Thi
- Cited by 6 (0 self) – Add To MetaCart

