256 search results - page 35 / 52 » A practical comparison of two K-Means clustering algorithms |
BMCBI
2007
14 years 9 months ago
2007
Background: Selecting the highest quality 3D model of a protein structure from a number of alternatives remains an important challenge in the field of structural bioinformatics. M...
101
Voted
BMCBI
2007
14 years 9 months ago
2007
Background: DNA microarray experiments are conducted in logical sets, such as time course profiling after a treatment is applied to the samples, or comparisons of the samples unde...
VRCAI
2006
ACM
15 years 3 months ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
79
Voted
CGF
2008
14 years 9 months ago
2008
In this paper we present a practical, simple and robust method to acquire the spatially-varying illumination of a real-world scene. The basic idea of the proposed method is to acq...
JCST
2008
14 years 9 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...