Sciweavers

1628 search results - page 153 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
122
Voted
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
15 years 9 months ago
Combining Multiple Weak Clusterings
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
Alexander P. Topchy, Anil K. Jain, William F. Punc...
139
Voted
CGF
2006
136views more  CGF 2006»
15 years 3 months ago
Cache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
Sung-Eui Yoon, Dinesh Manocha
126
Voted
BMCBI
2007
165views more  BMCBI 2007»
15 years 3 months ago
Direct maximum parsimony phylogeny reconstruction from genotype data
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
132
Voted
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
15 years 9 months ago
Exploring relationships between genotype and oral cancer development through XCS
In medical research, being able to justify decisions is generally as important as taking the right ones. Interpretability is then one of the chief characteristics a learning algor...
Alessandro Passaro, Flavio Baronti, Valentina Magg...
107
Voted
STACS
2010
Springer
15 years 10 months ago
Exact Covers via Determinants
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
Andreas Björklund