Sciweavers

8298 search results - page 1440 / 1660
» On the Complexity of Numerical Analysis
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
JAIR
1998
120views more  JAIR 1998»
15 years 6 months ago
The Automatic Inference of State Invariants in TIM
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...
Maria Fox, Derek Long
MTA
2002
195views more  MTA 2002»
15 years 6 months ago
Shot Partitioning Based Recognition of TV Commercials
Digital video applications exploit the intrinsic structure of video sequences. In order to obtain and represent this structure for video annotation and indexing tasks, the main ini...
Juan María Sánchez, Xavier Binefa, J...
PAMI
1998
128views more  PAMI 1998»
15 years 6 months ago
A Hierarchical Latent Variable Model for Data Visualization
—Visualization has proven to be a powerful and widely-applicable tool for the analysis and interpretation of multivariate data. Most visualization algorithms aim to find a projec...
Christopher M. Bishop, Michael E. Tipping
« Prev « First page 1440 / 1660 Last » Next »