Sciweavers

2010 search results - page 219 / 402
» Feature Subset Selection Using a Genetic Algorithm
Sort
View
ICA
2007
Springer
15 years 9 months ago
Two Improved Sparse Decomposition Methods for Blind Source Separation
In underdetermined blind source separation problems, it is common practice to exploit the underlying sparsity of the sources for demixing. In this work, we propose two sparse decom...
B. Vikrham Gowreesunker, Ahmed H. Tewfik
ICC
2000
IEEE
137views Communications» more  ICC 2000»
15 years 7 months ago
Stability of Maximal Size Matching Scheduling in Input-Queued Cell Switches
— We consider cell-based switch architectures in which the speedup of the internal switching fabric is not large enough to avoid input buffering. These architectures require a sc...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
15 years 6 months ago
Evolving ensemble of classifiers in random subspace
Various methods for ensemble selection and classifier combination have been designed to optimize the results of ensembles of classifiers. Genetic algorithm (GA) which uses the div...
Albert Hung-Ren Ko, Robert Sabourin, Alceu de Souz...
POPL
2003
ACM
16 years 3 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
INFOCOM
2000
IEEE
15 years 7 months ago
On the Stability of Input-Buffer Cell Switches with Speed-Up
— We consider cell-based switch architectures, whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling al...
Marco Ajmone Marsan, Emilio Leonardi, Marco Mellia...