256 search results - page 26 / 52 » A practical comparison of two K-Means clustering algorithms |
101
click to vote
ICSEA
2007
IEEE
15 years 7 months ago
2007
IEEE
— This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level caching scheme of the processor, and we introduc...
103
click to vote
NIPS
2004
15 years 2 months ago
2004
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
CAV
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
102
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
108
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Sustained research on the problem of determining which genes are differentially expressed on the basis of microarray data has yielded a plethora of statistical algorit...