Sciweavers

2229 search results - page 56 / 446
» Comparative analysis of biclustering algorithms
Sort
View
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
14 years 2 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park
BMCBI
2008
77views more  BMCBI 2008»
14 years 12 months ago
SeqAn An efficient, generic C++ library for sequence analysis
Background: The use of novel algorithmic techniques is pivotal to many important problems in life science. For example the sequencing of the human genome [1] would not have been p...
Andreas Döring, David Weese, Tobias Rausch, K...
DAC
2006
ACM
16 years 24 days ago
Statistical timing analysis with correlated non-gaussian parameters using independent component analysis
We propose a scalable and efficient parameterized block-based statistical static timing analysis algorithm incorporating both Gaussian and non-Gaussian parameter distributions, ca...
Jaskirat Singh, Sachin S. Sapatnekar
3DOR
2008
15 years 29 days ago
A 3D Face Recognition Algorithm Using Histogram-based Features
We present an automatic face recognition approach, which relies on the analysis of the three-dimensional facial surface. The proposed approach consists of two basic steps, namely ...
Xuebing Zhou, Helmut Seibert, Christoph Busch, Wol...
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 3 months ago
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
Riccardo Poli, Leonardo Vanneschi