On finding $k$ earliest arrival time journeys in public transit networks

However, in Section 7, we present a Jacobi polynomial iteration that uses the spectral gap of the gossip matrix to obtain the accelerated convergence rate.. An important result of

This complicates creation of queries that count the number of non-numerical elements (How many books are in the list?) Also, it does not allow introducing the DISTINCT

While there is a gain in economic efficiency from marginal cost pricing and two–part tariffs, this improvement comes at the expense of reduced public bus transit demand and

Using Degree Constrained Gravity Null-Models to understand the structure of journeys’ networks in Bicycle Sharing Systems.. ESANN 2017 - European Symposium on Artificial

For example, IQ-rewritability means rewritability of an OMQ from (ALCI, UCQ) into an OMQ from (ALCI , IQ) with the IQ formu- lated in ALCI, and PUBGP-rewritability means

We propose a technique to compute reachability queries in public transportation networks by partitioning the graph into cells and use a novel expansion technique based on up- per

This paper presented SANTA, the first algorithm for continuous top-k processing over information streams in a social network context, able to handle both mes- sage publication and

In this context, our main contributions are (i) a model that smoothly inte- grates content-based diversity into the continuous top-k processing model pre- sented in [1],