For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
This paper presents a closed edge detection method based on a level lines selection approach. The proposed method is based on an unsupervised probabilistic scheme using an a contra...
While many theoretical arguments against or in favor of open source and closed source software development have been presented, the empirical basis for the assessment of arguments...
In the propositional setting, a well-studied family of merging operators are distance-based ones: the models of the merged base are the closest interpretations to the given profile...