266 search results - page 22 / 54 » Adaptive Cluster Computing using JavaSpaces |
CONEXT
2007
ACM
13 years 11 months ago
2007
ACM
In Delay Tolerant Networks (DTN), diffusion protocols can benefit from the users’ mobility in order to reach some distant nodes. However, existing protocols like flooding pres...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as ...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
ICPR
2002
IEEE
14 years 10 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...