Sciweavers

2981 search results - page 442 / 597
» Word Sense and Subjectivity
Sort
View
JACM
2002
94views more  JACM 2002»
15 years 6 months ago
The greedy path-merging algorithm for contig scaffolding
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...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
JACM
1998
88views more  JACM 1998»
15 years 6 months ago
A Threshold of ln n for Approximating Set Cover
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 ...
Uriel Feige
CORR
1999
Springer
65views Education» more  CORR 1999»
15 years 6 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe
CSUR
1999
96views more  CSUR 1999»
15 years 6 months ago
Hypermedia on the Web: what will it take?
: Researchers in the hypermedia field often lament that the World Wide Web does not support many of hypermedia's rich structuring, navigation and annotation features. What wou...
Fabio Vitali, Michael Bieber
JMMA
2002
90views more  JMMA 2002»
15 years 6 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...