6181 search results - page 422 / 1237 » Transactional Cluster Computing |
126
click to vote
ESCIENCE
2006
IEEE
15 years 11 months ago
2006
IEEE
Many areas of science currently use computing resources as a important part of their research, and many research groups adopt cluster architecture to use them efficiently and mana...
154
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
135
Voted
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
178
click to vote
MOBIHOC
2002
ACM
16 years 4 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
164
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...