154 search results - page 6 / 31 » Algorithms for Implicit Hitting Set Problems |
IJFCS
2006
14 years 9 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
DATE
2000
IEEE
15 years 1 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
BILDMED
2006
14 years 11 months ago
2006
Abstract. We propose an algorithm for the segmentation of blood vessels in the kind of CT-data typical for diagnostics in a clinical environment. Due to poor quality and variance i...
TAMC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
IEEEPACT
2002
IEEE
15 years 2 months ago
2002
IEEE
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with L...