✦ LIBER ✦

The minimum-entropy set cover problem

✍ Scribed by Eran Halperin; Richard M. Karp

Book ID: 108281109
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 230 KB
Volume: 348
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.09.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Results on Minimum Entropy Set Cov

Tight Results on Minimum Entropy Set Cover

✍ Jean Cardinal; Samuel Fiorini; Gwenaël Joret 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 334 KB

Parallel and serial heuristics for the m

Parallel and serial heuristics for the minimum set cover problem

✍ Sreejit Chakravarty; Ajay Shekhawat 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 695 KB

We present a theoretical analysis and an experimental evaluation of four serial heuristics and four parallel heuristics for the minimum set cover problem. The serial heuristics trade off run time with the quality of the solution. The parallel heuristics are derived from one of the serial heuristics.

Hybrid heuristics for minimum cardinalit

Hybrid heuristics for minimum cardinality set covering problems

✍ Francis J. Vasko; George R. Wilson 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 407 KB

Entropy and set covering

✍ L.P. Lefkovitch 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 755 KB

The Minimum Substring Cover problem

✍ Danny Hermelin; Dror Rawitz; Romeo Rizzi; Stéphane Vialette 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 239 KB

The minimum feature set problem

✍ Kevin S. Van Horn; Tony R. Martinez 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 334 KB

One approach to improving the generalization power of a neural net is to try to minimize the number of nonzero weights used. We examine two issues relevant to this approach, .for single-layer nets. First we bound the VC dimension of the set of linear-threshold fimctions that have nonzero weights fig