434 search results - page 28 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
TIP
2010
14 years 4 months ago
2010
Abstract--Path openings and closings are morphological operations with flexible line segments as structuring elements. These line segments have the ability to adapt to local image ...
WABI
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
PRL
2008
14 years 9 months ago
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
NETWORKING
2000
14 years 11 months ago
2000
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
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...