For a graph G, let P(G; ) be its chromatic polynomial and let [G] be the set of graphs having P(G; ) as their chromatic polynomial. We call [G] the chromatic equivalence class of ...
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, ...
In this paper we exhibit a finite element method fitting a suitable geometry naturally associated with a class of degenerate elliptic equations (usually called Grushin type equatio...
This paper deals with the quantization problem of a random variable X taking values in a separable and reexive Banach space, and with the related question of clustering independ...
For decentralized control problems with quadratically invariant information constraints, the optimal controller may be found efficiently. In this paper, we show that there are sys...
In this paper, one presents a fuzzy color clustering algorithm that is based on a new measure of similarity. This new measure of color similarity is defined on a perceptual color s...