473 search results - page 91 / 95 » Computing shortest paths with uncertainty |
GRC
2008
IEEE
14 years 10 months ago
2008
IEEE
Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However, these approaches have not factored...
TKDE
2010
14 years 8 months ago
2010
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
121
click to vote
MST
2010
14 years 4 months ago
2010
We consider triply-nested loops of the type that occur in the standard Gaussian elimination algorithm, which we denote by GEP (or the Gaussian Elimination Paradigm). We present tw...
113
click to vote
DIALM
2003
ACM
15 years 2 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
186
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...