4009 search results - page 333 / 802 » Clustering on Complex Graphs |
162
click to vote
AINA
2009
IEEE
16 years 1 months ago
2009
IEEE
—One of the main advantages of clustering algorithms is the ability to allow networks to be physically divided into smaller regions, thereby increasing the theoretical maximum nu...
178
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
Resource allocation is a fundamental but challenging problem due to the complexity of cluster computing systems. In enterprise service computing, resource allocation is often asso...
166
click to vote
KBSE
2008
IEEE
16 years 1 months ago
2008
IEEE
For large software systems, interface structure has an important impact on their maintainability and build performance. For example, for complex systems written in C, recompilatio...
202
click to vote
PAKDD
2007
ACM
16 years 26 days ago
2007
ACM
While null space based linear discriminant analysis (NLDA) obtains a good discriminant performance, the ability easily suffers from an implicit assumption of Gaussian model with sa...
150
click to vote
ISCA
2005
IEEE
16 years 10 days ago
2005
IEEE
The traditional approach for characterizing complex systems is to run standard workloads and measure the resulting performance as seen by the end user. However, unique opportuniti...