982 search results - page 185 / 197 » Solving Steiner tree problems in graphs to optimality |
GD
2005
Springer
14 years 1 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
DATE
2010
IEEE
14 years 23 days ago
2010
IEEE
— Pattern recognition has many applications in design automation. A generalized pattern recognition algorithm is presented in this paper which can efficiently extract similar pat...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The segmentation of ultrasound images is challenging due to the difficulty of appropriate modeling of their appearance variations including speckle as well as signal dropout. We ...