2228 search results - page 75 / 446 » Distributed Data Clustering Can Be Efficient and Exact |
261
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
In this work we tackle the open problem of self-join size (SJS) estimation in a large-scale Distributed Data System, where tuples of a relation are distributed over data nodes whic...
177
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
Locating content efficiently and conveniently is the key issue in P2P systems. In this paper we present SemanticPeer, an Ontology-Based P2P lookup service, to address this problem,...
160
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We propose a method based on sparse representation
(SR) to cluster data drawn from multiple low-dimensional
linear or affine subspaces embedded in a high-dimensional
space. Our ...
195
Voted
CCGRID
2009
IEEE
15 years 10 months ago
2009
IEEE
From personal software to advanced systems, caching mechanisms have steadfastly been a ubiquitous means for reducing workloads. It is no surprise, then, that under the grid and clu...
159
Voted
HPDC
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper reports on the architecture and design of Starfish, an environment for executing dynamic (and static) MPI-2 programs on a cluster of workstations. Starfish is unique in ...