Sciweavers

1529 search results - page 149 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
FOCM
2011
90views more  FOCM 2011»
14 years 8 months ago
Hamiltonian Interpolation of Splitting Approximations for Nonlinear PDEs
We consider a wide class of semi linear Hamiltonian partial differential equations and their approximation by time splitting methods. We assume that the nonlinearity is polynomia...
Erwan Faou, Benoît Grebert
CVPR
2007
IEEE
16 years 6 months ago
Feature Extraction by Maximizing the Average Neighborhood Margin
A novel algorithm called Average Neighborhood Margin Maximization (ANMM) is proposed for supervised linear feature extraction. For each data point, ANMM aims at pulling the neighb...
Fei Wang, Changshui Zhang
JCP
2008
103views more  JCP 2008»
15 years 4 months ago
Weighted Clustering and Evolutionary Analysis of Hybrid Attributes Data Streams
It presents some definitions of projected cluster and projected cluster group on hybrid attributes after having given some definitions on ordered attributes and sorted attributes t...
Xinquan Chen
APIN
2000
120views more  APIN 2000»
15 years 4 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano
BMCBI
2007
166views more  BMCBI 2007»
15 years 4 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour