256 search results - page 3 / 52 » A practical comparison of two K-Means clustering algorithms |
ICA3PP
2005
Springer
15 years 2 months ago
2005
Springer
Shared Memory is an interesting communication paradigm for SMP machines and clusters. Weak consistency models have been proposed to improve efficiency of shared memory applications...
70
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
NDSS
2006
IEEE
15 years 3 months ago
2006
IEEE
Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The resulting platforms provide computational power pre...
AI
2005
Springer
15 years 3 months ago
2005
Springer
Spatial clustering is an active research area in spatial data mining with various methods reported. In this paper, we compare two density-based methods, DBSCAN and DBRS. First, we ...
ALENEX
2009
14 years 10 months ago
2009
We experimentally compare the two algorithms A and B by Fredman and Khachiyan [FK96] for the problem Monet--given two monotone Boolean formulas in DNF and in CNF, decide whether ...