396 search results - page 36 / 80 » An Optimal Minimum Spanning Tree Algorithm |
ICIP
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
107
click to vote
TCAD
2002
15 years 1 days ago
2002
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
114
click to vote
ALGORITHMICA
2010
15 years 16 days ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
117
Voted
LCN
2006
IEEE
15 years 6 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
129
click to vote
SODA
1992
ACM
15 years 1 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...