18 search results - page 1 / 4 » On Approximating Node-Disjoint Paths in Grids |
SIAMCOMP
2010
13 years 3 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
LATIN
2010
Springer
13 years 3 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
DAGM
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. The Gaussian scale-space is a standard tool in image analysis. While continuous in theory, it is generally realized with fixed regular grids in practice. This prevents th...
LCN
2006
IEEE
13 years 10 months ago
2006
IEEE
To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. The issue of protecting multicast ses...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
Bearings-only localization with light-of-sight (LOS) propagation is well understood. This paper concentrates on bearing-only localization with non-line-of-sight (NLOS) measurement...