446 search results - page 22 / 90 » A fast algorithm for computing steiner edge connectivity |
OPODIS
2008
14 years 11 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
ICPR
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper we introduce a novel graphical image representation comprising a single curve—the one-liner. The first step involves the detection and linking of image edges. We ...
PERCOM
2004
ACM
15 years 9 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
86
Voted
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
76
Voted
TIP
2010
14 years 4 months ago
2010
Nonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficu...