5138 search results - page 47 / 1028 » Low-Entropy Set Selection. |
JACM
1998
13 years 9 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 ...
ICLP
2009
Springer
14 years 10 months ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
DIS
1999
Springer
14 years 2 months ago
1999
Springer
: This paper shows that a connectionist law discovery method called RF5X can discover a law in the form of a set of nominally conditioned polynomials, from data containing both nom...
CINQ
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. One of the exciting scientific challenges in functional genomics concerns the discovery of biologically relevant patterns from gene expression data. For instance, it is e...
TASLP
2002
13 years 9 months ago
2002
This paper presents a set of corpus-based text-to-speech synthesis technologies for Mandarin Chinese. A large speech corpus produced by a single speaker is used, and the speech out...