5624 search results - page 47 / 1125 » On Conditional Covering Problem |
116
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
115
click to vote
MICS
2010
14 years 9 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
123
Voted
FPL
1997
Springer
15 years 6 months ago
1997
Springer
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...
109
click to vote
LREC
2008
15 years 3 months ago
2008
In this paper we discuss the design, acquisition and preprocessing of a Czech audio-visual speech corpus. The corpus is intended for training and testing of existing audio-visual ...
120
click to vote
ICCTA
2007
IEEE
15 years 8 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...