2228 search results - page 118 / 446 » Distributed Data Clustering Can Be Efficient and Exact |
210
click to vote
ECCV
2008
Springer
16 years 8 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...
177
click to vote
CCGRID
2006
IEEE
16 years 24 days ago
2006
IEEE
A challenging issue facing Grid communities is that while Grids can provide access to many heterogeneous resources, the resources to which access is provided often do not match th...
164
click to vote
JIPS
2006
15 years 6 months ago
2006
: This paper presents a feature selection technique based on distributional differences for efficient machine learning. Initial training data consists of data including many featur...
185
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
MPI is the main standard for communication in high-performance clusters. MPI implementations use the Eager protocol to transfer small messages. To avoid the cost of memory registr...
174
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
We describe the implementation of an out-of-core, distribution-based sorting program on a cluster using FG, a multithreaded programming framework. FG mitigates latency from disk-I/...