Sciweavers

2252 search results - page 85 / 451
» Improving Random Forests
Sort
View
CSCLP
2005
Springer
14 years 1 months ago
On Generators of Random Quasigroup Problems
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...
Roman Barták
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
13 years 11 months ago
A new approach for shortest path routing problem by random key-based GA
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...
Mitsuo Gen, Lin Lin
PAA
2002
13 years 7 months ago
Bagging, Boosting and the Random Subspace Method for Linear Classifiers
: Recently bagging, boosting and the random subspace method have become popular combining techniques for improving weak classifiers. These techniques are designed for, and usually ...
Marina Skurichina, Robert P. W. Duin
CVPR
2009
IEEE
15 years 3 months ago
Increased Discrimination in Level Set Methods with Embedded Conditional Random Fields
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 ...
ICIP
2005
IEEE
14 years 9 months ago
A segmentation method using compound Markov random fields based on a general boundary model
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 ...
Jue Wu, Albert C. S. Chung