Ivan Gerace

Learn More
We show that computing (and even approximating) MAXIMUM CLIQUE and MINIMUM GRAPH COLORING for circulant graphs is essentially as hard as in the general case. In contrast, we show that, under additional constraints, e.g., prime order and/or sparseness, GRAPH ISOMORPHISM and MINIMUM GRAPH COLORING become easier in the circulant case, and we take advantage of(More)
In this paper, we apply Bayesian blind source separation (BSS) from noisy convolutive mixtures to jointly separate and restore source images degraded through unknown blur operators, and then linearly mixed. We found that this problem arises in several image processing applications, among which there are some interesting instances of degraded document(More)
We tackle the problem of estimating the Shannon capacity of cycles of odd length. We present some strategies which allow us to nd tight bounds on the Shannon capacity of cycles of various odd lengths, and suggest that the diiculty of obtaining a general result may be related to diierent behaviours of the capacity, depending on the \structure" of the odd(More)