In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
Abstract. The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC ...
Debugging inconsistent OWL ontologies is a timeconsuming task. Debugging services included in existing ontology engineering tools are still far from providing adequate support to ...
In this paper, an entropic thresholding method based on the gray-level spatial correlation (GLSC) histogram defined by ourselves is presented. Compared with traditional two-dimens...
Abstract—The adoption of new hardware and software architectures will make future generations of pervasive devices more flexible and extensible. Networks of computational nodes ...
Alberto Ferrante, Roberto Pompei, Anastasia Stulov...