1225 search results - page 32 / 245 » Maximal Consistent Subsets |
ESWS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Despite of their advertisement as task independent representations, the reuse of ontologies in different contexts is difficult. An explanation for this is that when devel...
IPCO
2004
13 years 9 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
AAAI
2011
12 years 7 months ago
2011
In this paper, we propose a novel method to select the most informative subset of features, which has little redundancy and very strong discriminating power. Our proposed approach...
IPL
2006
13 years 7 months ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
APAL
2006
13 years 7 months ago
2006
We present a technique for destroying stationary subsets of P+ using partial square sequences. We combine this method with Gitik's poset for changing the cofinality of a cardi...