446 search results - page 33 / 90 » A fast algorithm for computing steiner edge connectivity |
102
click to vote
SAC
2003
ACM
15 years 2 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The security gateways today are required not only to block unauthorized accesses by authenticating packet headers, but also by inspecting connection states to defend against malic...
RECOMB
2006
Springer
15 years 10 months ago
2006
Springer
Computational and comparative analysis of protein-protein interaction (PPI) networks enable understanding of the modular organization of the cell through identification of functio...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
116
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Accurately identifying corresponded landmarks from a
population of shape instances is the major challenge in
constructing statistical shape models. In general, shapecorrespondenc...