332 search results - page 56 / 67 » Parameterized Graph Separation Problems |
BMCBI
2010
13 years 7 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
HICSS
2008
IEEE
14 years 1 months ago
2008
IEEE
Object-oriented analysis suggests semiformal usecase driven techniques for problem domain modeling from a computation independent viewpoint. The proposed approach called Topologic...
ICCV
2005
IEEE
14 years 29 days ago
2005
IEEE
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
FCT
2005
Springer
14 years 24 days ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...