Sciweavers

970 search results - page 43 / 194
» case 2011
Sort
View
DAM
2011
13 years 2 months ago
Minimum sum set coloring of trees and line graphs of trees
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...
Flavia Bonomo, Guillermo Durán, Javier Mare...
DCC
2011
IEEE
13 years 2 months ago
Primitive polynomials, singer cycles and word-oriented linear feedback shift registers
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...
Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari
ISCI
2011
13 years 2 months ago
Sequential covering rule induction algorithm for variable consistency rough set approaches
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
SIAMDM
2011
13 years 2 months ago
On Maximal S-Free Convex Sets
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...
Diego A. Morán R., Santanu S. Dey
WWW
2011
ACM
13 years 2 months ago
Query completion without query logs for song search
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 ...
Nitin Dua, Kanika Gupta, Monojit Choudhury, Kalika...