262 search results - page 10 / 53 » Image Registration with Minimum Spanning Tree Algorithm |
104
Voted
CORR
2010
Springer
15 years 12 days ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
122
click to vote
ALGORITHMICA
2004
15 years 1 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
146
Voted
CVPR
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a new, robust and computationally efficient method for estimating the probability density of the intensity values in an image. Our approach makes use of a continuous r...
122
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
136
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...