We comment on several aspects of Skilling's paper presented at Valencia 8. In particular we prove the convergence in probability of the algorithm for a wide class of situations, comment on its potential utility and discuss aspects where further work is needed to assess the approach.

Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a speciied number of subsets such that few edges join two vertices in diierent subsets. Several new graph partitioning al...

This paper describes an improvement on a Partition and Replicate Strategy (PRS) for distributed query processing in a multi-database environment in which relations are unfragmented and replicated. For a given set of relations to be partitioned, determining the optimal copies of the relations to be partitioned is NP-hard. A heuristic algorithm is proposed. Our experimental results show that the ...

Finding a set of nested partitions dataset is useful to uncover relevant structure at different scales, and often dealt with data-dependent methodology. In this paper, we introduce general two-step methodology for model-based hierarchical clustering. Considering the integrated classification likelihood criterion as an objective function, work applies every discrete latent variable models (DLVMs...

Graph signal processing is a ubiquitous task in many applications such as sensor, social, transportation and brain networks, point cloud processing, graph neural networks. Often, signals are corrupted the sensing process, thus requiring restoration. In this paper, we propose two restoration methods based on deep algorithm unrolling (DAU). First, present denoiser by iterations of alternating dir...