396 search results - page 32 / 80 » An Optimal Minimum Spanning Tree Algorithm |
ICIP
2009
IEEE
14 years 10 months ago
2009
IEEE
We propose a region-based method to extract semantic foreground regions from color video sequences with static backgrounds. First, we introduce a new distance measure for backgrou...
104
Voted
GECCO
1999
Springer
15 years 4 months ago
1999
Springer
The design and development of network infrastructure to support mission-critical operations has become a critical and complicated issue. In this study we explore the use of geneti...
164
click to vote
ICCAD
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
128
click to vote
WADS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
103
click to vote
ESA
1994
Springer
15 years 4 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...