This paper addresses the clustering problem given the similarity matrix of a dataset. By representing this matrix as a weighted graph we transform this problem to a graph clustering/partitioning problem which aims at identifying groups of strongly inter-connected vertices. We define two distinct criteria with the aim of simultaneously minimizing the cut size and obtaining balanced clusters. The...

Fair division methods offer guarantees to agents of the proportional size or quality of their share in a division of a resource (cake). These guarantees come with a price. Standard fair division methods (or ”cake cutting” algorithms) do not find efficient allocations (not Pareto optimal). The lack of efficiency of these methods makes them less attractive for solving multi-agent resource and tas...

Abs t rac t The optimal design parameters of classifiers for omni-font machine-printed numeral recognition based on the minimum classification error (MCE) criterion are determined experimentall y. The design parameters that influence the accuracy of an optical character reader (OCR) are: similarity measure (or distance measure), kinds of features, dimension of the feature vector, method of trai...

Inter-session network coding is well known for its ability to spectral efficiency and endto-end throughput in wireless multi-hop networks by up to four fold on some scenarios compared to standard routing. However, a variety of inter-session network coding implementations have consistently shown a decrease in throughput when operating at high traffic loads and significantly below the values expe...