Sciweavers

715 search results - page 93 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
TIFS
2008
157views more  TIFS 2008»
14 years 9 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
ICAPR
2009
Springer
15 years 4 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri
IPMI
2007
Springer
15 years 10 months ago
A Shape-Guided Deformable Model with Evolutionary Algorithm Initialization for 3D Soft Tissue Segmentation
Abstract. We present a novel method for the segmentation of volumetric images, which is especially suitable for highly variable soft tissue structures. Core of the algorithm is a s...
Hans-Peter Meinzer, Ivo Wolf, Sascha Münzing,...
EMO
2003
Springer
81views Optimization» more  EMO 2003»
15 years 3 months ago
Solving Hierarchical Optimization Problems Using MOEAs
Abstract. In this paper, we propose an approach for solving hierarchical multi-objective optimization problems (MOPs). In realistic MOPs, two main challenges have to be considered:...
Christian Haubelt, Sanaz Mostaghim, Jürgen Te...
BMCBI
2006
169views more  BMCBI 2006»
14 years 9 months ago
Comparative analysis of haplotype association mapping algorithms
Background: Finding the genetic causes of quantitative traits is a complex and difficult task. Classical methods for mapping quantitative trail loci (QTL) in miceuse an F2 cross b...
Phillip McClurg, Mathew T. Pletcher, Tim Wiltshire...