3112 search results - page 111 / 623 » Cluster Computing White Paper |
137
click to vote
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
102
Voted
JSSPP
2005
Springer
15 years 9 months ago
2005
Springer
With Grids, we are able to share computing resources and to provide for scientific communities a global transparent access to local facilities. In such an environment the problems...
111
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
143
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
This paper studies automatic segmentation of multiple
motions from tracked feature points through spectral embedding
and clustering of linear subspaces. We show that
the dimensi...
157
Voted
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...