Sciweavers

4903 search results - page 2 / 981
» The Set Covering Machine
Sort
View
FCCM
2002
IEEE
131views VLSI» more  FCCM 2002»
13 years 10 months ago
Custom Computing Machines for the Set Covering Problem
Christian Plessl, Marco Platzner
ICML
2010
IEEE
13 years 6 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes
DAM
2007
84views more  DAM 2007»
13 years 5 months ago
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Vera Kurková, Marcello Sanguineti
ML
2008
ACM
156views Machine Learning» more  ML 2008»
13 years 5 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani
SOFSEM
2010
Springer
14 years 2 months ago
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
Alain Finkel, Arnaud Sangnier