Sciweavers

639 search results - page 114 / 128
» Comparative analysis of genetic algorithm implementations
Sort
View
BMCBI
2010
118views more  BMCBI 2010»
13 years 7 months ago
svdPPCS: an effective singular value decomposition-based method for conserved and divergent co-expression gene module identifica
Background: Comparative analysis of gene expression profiling of multiple biological categories, such as different species of organisms or different kinds of tissue, promises to e...
Wensheng Zhang, Andrea Edwards, Wei Fan, Dongxiao ...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
BCS
2008
13 years 9 months ago
Fast Estimation of Nonparametric Kernel Density Through PDDP, and its Application in Texture Synthesis
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
Arnab Sinha, Sumana Gupta
OPODIS
2003
13 years 8 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
CORR
2007
Springer
173views Education» more  CORR 2007»
13 years 7 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge