2131 search results - page 116 / 427 » Co-Scheduling of Computation and Data on Computer Clusters |
153
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...
135
click to vote
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
In many applications, the expert interpretation of coclustering is easier than for mono-dimensional clustering. Co-clustering aims at computing a bi-partition that is a collection...
144
click to vote
SI3D
1997
ACM
15 years 8 months ago
1997
ACM
This paper presents a practical technique to automatically compute approximations of polygonal representations of 3D objects. It is based on a previously developed model simplific...
132
click to vote
WIMOB
2008
IEEE
15 years 10 months ago
2008
IEEE
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
128
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...