7106 search results - page 1137 / 1422 » Restricted Complexity, General Complexity |
169
click to vote
JACM
2002
15 years 6 months ago
2002
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
177
click to vote
IGPL
1998
15 years 6 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
165
click to vote
JACM
1998
15 years 6 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 ...
169
click to vote
JAIR
1998
15 years 6 months ago
1998
As planning is applied to larger and richer domains the e ort involved in constructing domain descriptions increases and becomes a signi cant burden on the human application desig...
189
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is...