Sciweavers

6368 search results - page 128 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
GECCO
2003
Springer
171views Optimization» more  GECCO 2003»
15 years 10 months ago
Genetic Algorithm Optimized Feature Transformation - A Comparison with Different Classifiers
When using a Genetic Algorithm (GA) to optimize the feature space of pattern classification problems, the performance improvement is not only determined by the data set used, but a...
Zhijian Huang, Min Pei, Erik D. Goodman, Yong Huan...
PRL
2011
15 years 1 days ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
142
Voted
TSI
2008
89views more  TSI 2008»
15 years 5 months ago
RedGRID, un environnement pour la redistribution d'objets complexes
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
Aurélien Esnard
162
Voted
ESA
2008
Springer
111views Algorithms» more  ESA 2008»
15 years 6 months ago
Parallel Imaging Problem
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
Thành Nguyen, Éva Tardos
ESANN
2004
15 years 6 months ago
Separability of analytic postnonlinear blind source separation with bounded sources
The aim of blind source separation (BSS) is to transform a mixed random vector such that the original sources are recovered. If the sources are assumed to be statistically independ...
Fabian J. Theis, Peter Gruber