982 search results - page 131 / 197 » Solving Steiner tree problems in graphs to optimality |
145
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
156
click to vote
ALMOB
2006
15 years 4 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
181
click to vote
MVA
2008
15 years 4 months ago
2008
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
159
click to vote
JMLR
2010
14 years 11 months ago
2010
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
126
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...