Sciweavers

287 search results - page 5 / 58
» Hypothesis Testing over Factorizations for Data Association
Sort
View
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 9 months ago
Testing parallelization paradigms for MOEAs
In this paper, we report on our investigation of factors affecting the performance of various parallelization paradigms for multiobjective evolutionary algorithms. Different paral...
Sadeesha Gamhewa, Philip Hingston
RECOMB
2005
Springer
14 years 9 months ago
The Factor Graph Network Model for Biological Systems
Abstract. We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
JMLR
2010
116views more  JMLR 2010»
13 years 3 months ago
Feature Selection, Association Rules Network and Theory Building
As the size and dimensionality of data sets increase, the task of feature selection has become increasingly important. In this paper we demonstrate how association rules can be us...
Sanjay Chawla
RECOMB
2009
Springer
14 years 9 months ago
COE: A General Approach for Efficient Genome-Wide Two-Locus Epistasis Test in Disease Association Study
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
Xiang Zhang, Feng Pan, Yuying Xie, Fei Zou, Wei Wa...
ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
14 years 3 months ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...