613 search results - page 63 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
156
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
137
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
125
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
114
click to vote
DAM
2007
15 years 3 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
155
click to vote
DISOPT
2010
15 years 3 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...