613 search results - page 43 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
113
click to vote
SIAMDM
2010
15 years 1 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
119
click to vote
FSTTCS
2005
Springer
15 years 8 months ago
2005
Springer
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
139
click to vote
MPC
1992
Springer
15 years 7 months ago
1992
Springer
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
161
Voted
PAMI
2010
15 years 1 months ago
2010
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
107
click to vote
JCO
2010
15 years 1 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...