9405 search results - page 147 / 1881 » Computing a Model of Set Theory |
132
click to vote
ML
2000
ACM
15 years 3 months ago
2000
ACM
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
128
Voted
JACM
1998
15 years 2 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
123
click to vote
CSB
2005
IEEE
15 years 9 months ago
2005
IEEE
In the feature selection of cancer classification problems, many existing methods consider genes individually by choosing the top genes which have the most significant signal-to...
126
click to vote
CSC
2008
15 years 4 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
129
click to vote
CHI
2009
ACM
16 years 3 months ago
2009
ACM
User interfaces and information systems have become increasingly social in recent years, aimed at supporting the decentralized, cooperative production and use of content. A theory...