6181 search results - page 531 / 1237 » Transactional Cluster Computing |
254
click to vote
COMGEO
2004
ACM
15 years 7 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
219
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The implementation of high throughput sequencing for exploring biodiversity poses high demands on bioinformatics applications for automated data processing. Here we in...
231
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
192
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the following basic question: a source node wishes to stream an ordered sequence of packets to a collection of receivers, which are distributed among a number of clust...
208
click to vote
ACCV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper presents a novel nonparametric clustering algorithm called evolving mean shift (EMS) algorithm. The algorithm iteratively shrinks a dataset and generates well ...