578 search results - page 15 / 116 » The Minimum-Entropy Set Cover Problem |
ICMCS
2008
IEEE
14 years 2 months ago
2008
IEEE
As an important attribute directly influencing the steganographic scheme, the embedding efficiency is defined as the average number of random data bits per one embedding change...
FOCM
2010
13 years 6 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
ADMA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...