Sciweavers

241 search results - page 9 / 49
» Efficient Parallel Algorithms for Euclidean Distance Transfo...
Sort
View
GECCO
2006
Springer
121views Optimization» more  GECCO 2006»
13 years 11 months ago
A splicing/decomposable encoding and its novel operators for genetic algorithms
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
Yong Liang, Kwong-Sak Leung, Kin-Hong Lee
BMCBI
2010
135views more  BMCBI 2010»
13 years 7 months ago
MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees
Background: MapReduce is a parallel framework that has been used effectively to design largescale parallel applications for large computing clusters. In this paper, we evaluate th...
Suzanne Matthews, Tiffani L. Williams
MICCAI
2008
Springer
14 years 9 months ago
Symmetric Log-Domain Diffeomorphic Registration: A Demons-Based Approach
Abstract. Modern morphometric studies use non-linear image registration to compare anatomies and perform group analysis. Recently, logEuclidean approaches have contributed to promo...
Tom Vercauteren, Xavier Pennec, Aymeric Perchant...
ICPP
2000
IEEE
14 years 3 days ago
Partitioning Loops with Variable Dependence Distances
A new technique to parallelize loops with variable distance vectors is presented. The method extends previous methods in two ways. First, the present method makes it possible for ...
Yijun Yu, Erik H. D'Hollander
CVPR
2008
IEEE
14 years 9 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs