256 search results - page 11 / 52 » A practical comparison of two K-Means clustering algorithms |
90
Voted
WEA
2007
Springer
15 years 5 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
99
Voted
WWW
2004
ACM
16 years 8 days ago
2004
ACM
Organizing Web search results into a hierarchy of topics and subtopics facilitates browsing the collection and locating results of interest. In this paper, we propose a new hierar...
106
click to vote
BMCBI
2010
14 years 9 months ago
2010
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
ICC
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper proposes a simple equalizer for a recent multicarrier block transmission scheme which pads zeros (as opposed to a cyclic prefix) in each transmitted block. In the abse...
IMSCCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Background: DNA Microarray technology is an innovative methodology in experimental molecular biology, which has produced huge amounts of valuable data in the profile of gene expre...