Widely varying node degrees occur in software dependency graphs, hyperlink structures, social networks, and many other real-world graphs. Finding dense subgraphs in such graphs is ...
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Clustered architectures are a solution to the bottleneck of centralized register files in superscalar and VLIW processors. The main challenge associated with clustered architectu...
In this paper we present a method for impulse noise removal that makes use of spectral clustering and graph regularization. The image is modeled as a graph and local spectral anal...
Olivier Lezoray, Vinh-Thong Ta, Abderrahim Elmoata...
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...