Sciweavers

7648 search results - page 178 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
92
Voted
TIT
2008
74views more  TIT 2008»
15 years 2 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
116
Voted
ISNN
2007
Springer
15 years 8 months ago
Memetic Algorithms for Feature Selection on Microarray Data
In this paper, we present two novel memetic algorithms (MAs) for gene selection. Both are synergies of Genetic Algorithm (wrapper methods) and local search methods (filter methods...
Zexuan Zhu, Yew-Soon Ong
113
Voted
ICPR
2004
IEEE
16 years 3 months ago
Multi-Class Extensions of the GLDB Feature Extraction Algorithm for Spectral Data
The Generalized Local Discriminant Bases (GLDB) algorithm proposed by Kumar, Ghosh and Crawford in [4], is a effective feature extraction method for spectral data. It identifies g...
Pavel Paclík, Robert P. W. Duin, Serguei Ve...
110
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
Sensor Network Localization Using Sensor Perturbation
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
Yuanchen Zhu, Steven J. Gortler, Dylan Thurston
108
Voted
ICPPW
2005
IEEE
15 years 8 months ago
Gene Ordering in Microarray Data Using Parallel Memetic Algorithms
This paper addresses the Microarray Gene Ordering problem. It consists in ordering a set of genes, grouping together the ones with similar behavior. This behavior can be measured ...
Alexandre Mendes, Carlos Cotta, Vinícius Ga...