21 search results - page 3 / 5 » Relation-Algebraic Derivation of Spanning Tree Algorithms |
ICIP
2004
IEEE
14 years 10 months ago
2004
IEEE
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
ECSQARU
2009
Springer
14 years 3 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
FSTTCS
2005
Springer
14 years 2 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...
DAC
1989
ACM
14 years 19 days ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...