15494 search results - page 113 / 3099 » Computing dynamic clusters |
128
Voted
WEA
2010
Springer
15 years 7 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
119
click to vote
HPDC
2010
IEEE
15 years 3 months ago
2010
IEEE
Scientists increasingly rely on the execution of workflows in grids to obtain results from complex mixtures of applications. However, the inherently dynamic nature of grid workflo...
146
Voted
CSIE
2009
IEEE
15 years 9 months ago
2009
IEEE
The paper presents an evaluation of four clustering algorithms: k-means, average linkage, complete linkage, and Ward’s method, with the latter three being different hierarchical...
136
Voted
ICAC
2006
IEEE
15 years 8 months ago
2006
IEEE
— In autonomic provisioning, a resource manager allocates resources to an application, on-demand, e.g., during load spikes. Modelling-based approaches have proved very successful...
147
Voted
EDBT
2000
ACM
15 years 7 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...