446 search results - page 43 / 90 » A fast algorithm for computing steiner edge connectivity |
BMCBI
2005
13 years 7 months ago
2005
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
GD
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents a novel algorithm for unsupervised texture segmentation. We incorporate a set of texture features under a segmentation framework, based on the active contour w...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
CLUSTER
2000
IEEE
14 years 19 hour ago
2000
IEEE
To construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switc...