Sciweavers

697 search results - page 41 / 140
» A Study of Evaluation Functions for the Graph K-Coloring Pro...
Sort
View
ISAAC
2005
Springer
110views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Minimum Entropy Coloring
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
ISBI
2011
IEEE
12 years 11 months ago
Sparse Riemannian manifold clustering for HARDI segmentation
We address the problem of segmenting high angular resolution diffusion images of the brain into cerebral regions corresponding to distinct white matter fiber bundles. We cast thi...
Hasan Ertan Çetingül, René Vida...
ICIAR
2007
Springer
14 years 2 months ago
Parameterless Discrete Regularization on Graphs for Color Image Filtering
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered...
Olivier Lezoray, Sébastien Bougleux, Abderr...
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
14 years 1 months ago
A Study of the Role of Single Node Mutation in Genetic Programming
In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer th...
Wei Quan, Terence Soule
ER
2009
Springer
92views Database» more  ER 2009»
14 years 2 months ago
On Matrix Representations of Participation Constraints
Abstract. We discuss the existence of matrix representations for generalised and minimum participation constraints which are frequently used in database design and conceptual model...
Sven Hartmann, Uwe Leck, Sebastian Link