8437 search results - page 490 / 1688 » Preferences over Sets |
159
click to vote
JCSS
2008
15 years 7 months ago
2008
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
178
click to vote
EJC
2007
15 years 7 months ago
2007
We examine the binary codes obtained from the row span over the field F2 of an adjacency matrix of the rectangular lattice graphs L2(m, n) for 3 ≤ m < n and show that permut...
120
click to vote
AML
2002
15 years 6 months ago
2002
Continuing the investigations of X. Yu and others, we study the role of set existence axioms in classical Lebesgue measure theory. We show that pairwise disjoint countable additivi...
200
click to vote
APIN
2004
15 years 6 months ago
2004
A rough self-organizing map (RSOM) with fuzzy discretization of feature space is described here. Discernibility reducts obtained using rough set theory are used to extract domain k...
163
click to vote
DM
1999
15 years 6 months ago
1999
If : L L is a bijection from the set of lines of a linear space (P, L) onto the set of lines of a linear space (P , L ) (dim (P, L), dim (P , L ) 3), such that intersecting lin...