Given a clustered graph (G,V), that is, a graph G = (V,E) together with a partition V of its vertex set, the selective coloring problem consists in choosing one vertex per cluster such that the chromatic number of the subgraph induced by the chosen vertices is minimum. This problem can be formulated as a covering problem with a 0-1 matrix M(G,V). Nevertheless, we observe that, given (G,V), it i...

We propose to cluster class-wise covariance matrices in order to identify different groups of covariances contributing to the same condition. Each cluster represents a different brain pattern associated with one class. Further, we present Clustered Common Spatial Patterns, a new algorithm that applies this technique prior to CSP. We show that CCSP can outperform CSP in a binary imagery movement...

We study the version of the C-PLANARITY problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the STRIP PLANARITY problem. We give algorithms to decide several families of instances for the two variants in which the order of the pipes around each cluster is given as part of the input or can be chosen by the algorithm.

Causal arguments are ubiquitous in human reasoning about physical phenomena. Formalization and computer modeling of these arguments is a major goal of qualitative physics. Building causal qualitative models of rich domains like classical thermodynamics has proven to be difficult . The most accessible and widely agreed upon source of knowledge is found in textbooks, usually in the form of noncau...