In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plaus...
We present a general rule induction algorithm based on sequential covering, suitable for variable consistency rough set approaches. This algorithm, called VC-DomLEM, can be used f...
Jerzy Blaszczynski, Roman Slowinski, Marcin Szelag
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
We describe a new method for query completion for Bollywood song search without using query logs. Since song titles in nonEnglish languages (Hindi in our case) are mostly present ...