1162 search results - page 78 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
DISOPT
2008
13 years 8 months ago
2008
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
SIAMDM
2008
13 years 8 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
JDCTA
2010
13 years 3 months ago
2010
The method of improved wavelet transform neural network based on hybrid GA(genetic algorithm) is presented to diagnose rolling bearings faults in this paper. Genetic Artificial Ne...
TCAD
2008
13 years 8 months ago
2008
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
Interactive or semi-automatic segmentation is a useful alternative to pure automatic segmentation in many applications. While automatic segmentation can be very challenging, a sma...