25 search results - page 5 / 5 » Finding time-dependent shortest paths over large graphs |
KDD
2008
ACM
14 years 5 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
INFOCOM
2002
IEEE
13 years 10 months ago
2002
IEEE
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...
CIKM
2007
Springer
13 years 9 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
SIAMSC
2010
13 years 1 days ago
2010
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
IDA
2009
Springer
13 years 3 months ago
2009
Springer
In the last decade, Social Network Analysis has been a field in which the effort devoted from several researchers in the Data Mining area has increased very fast. Among the possibl...