9871 search results - page 188 / 1975 » On the Structure of Low Sets |
143
click to vote
CALCO
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. For any set-endofunctor T : Set → Set there exists a largest subcartesian transformation µ to the filter functor F : Set → Set. Thus we can associate with every T-c...
143
click to vote
AIPS
2008
15 years 8 months ago
2008
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...
166
click to vote
JODS
2007
15 years 6 months ago
2007
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...
197
click to vote
INFSOF
2008
15 years 6 months ago
2008
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
164
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...