Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
d Abstract) Tiziana Calamoneri 1 , Saverio Caminiti 2 , and Rossella Petreschi 3 Dipartimento di Informatica Universit`a degli Studi di Roma "La Sapienza" Via Salaria 113...
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
— In this paper, a new meta-method based on the physical nuclear process is presented. This meta-method called Fusion-Fission is applied to the two different class of graph parti...
Clustered architectures are a solution to the bottleneck of centralized register files in superscalar and VLIW processors. The main challenge associated with clustered architectu...