262 search results - page 43 / 53 » Image Registration with Minimum Spanning Tree Algorithm |
123
Voted
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
144
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
127
Voted
LCN
2006
IEEE
15 years 7 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
115
click to vote
DGCI
2005
Springer
15 years 7 months ago
2005
Springer
The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,9] consists in modifying the original image by lowering...
140
Voted
SODA
1992
ACM
15 years 3 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...