Sciweavers

262 search results - page 26 / 53
» Image Registration with Minimum Spanning Tree Algorithm
Sort
View
DAM
1999
169views more  DAM 1999»
14 years 9 months ago
Approximating the Weight of Shallow Steiner Trees
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
Guy Kortsarz, David Peleg
APPINF
2003
14 years 11 months ago
Corner-First Tree-based Region Broadcasting in Mesh Networks
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
Hadeel Haddad, Muhammad F. Mudawwar
EOR
2006
110views more  EOR 2006»
14 years 9 months ago
Scatter search with path relinking for phylogenetic inference
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
Carlos Cotta
IPPS
2010
IEEE
14 years 7 months ago
Parallel external memory graph algorithms
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
Lars Arge, Michael T. Goodrich, Nodari Sitchinava
CVPR
2008
IEEE
15 years 11 months ago
A statistical deformation prior for non-rigid image and shape registration
Non-rigid registration is central to many problems in computer vision and medical image analysis. We propose a registration algorithm which is regularized by prior knowledge in th...
Marcel Lüthi, Thomas Albrecht, Thomas Vetter