43 search results - page 5 / 9 » Querying approximate shortest paths in anisotropic regions |
107
click to vote
W2GIS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
79
Voted
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we discuss the cache replacement policy in a multimedia transcoding proxy. Unlike the cache replacement for conventional web objects, to replace some elements with ...
88
Voted
COCOON
2001
Springer
15 years 2 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
180
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region S to some target region T will inte...