Sciweavers

603 search results - page 89 / 121
» Word or Phrase
Sort
View
JACM
2002
94views more  JACM 2002»
13 years 7 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
CGF
1999
159views more  CGF 1999»
13 years 7 months ago
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing th...
João Comba, James T. Klosowski, Nelson L. M...
JACM
1998
88views more  JACM 1998»
13 years 7 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
CSUR
1999
96views more  CSUR 1999»
13 years 7 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
RSA
2002
99views more  RSA 2002»
13 years 7 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott