Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
: Recently bagging, boosting and the random subspace method have become popular combining techniques for improving weak classifiers. These techniques are designed for, and usually ...
We propose a novel approach for improving level set seg-
mentation methods by embedding the potential functions
from a discriminatively trained conditional random field
(CRF) in...
Dana Cobzas (University of Alberta), Mark Schmidt ...
Markov random field (MRF) theory has widely been applied to segmentation in noisy images. This paper proposes a new MRF method. First, it couples the original labeling MRF with a ...