Partial words are finite sequences over a finite alphabet A that may contain a number of “do not know” symbols denoted by ’s. Setting A = A ∪ { }, A∗ denotes the set o...
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
An improved method for generalized constrained canonical correlation analysis (GCCANO) is proposed. In the original GCCANO, data matrices were first decomposed into the sum of sev...