578 search results - page 87 / 116 » The Minimum-Entropy Set Cover Problem |
109
Voted
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
136
Voted
JMLR
2010
14 years 9 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
137
Voted
ICDE
2010
IEEE
15 years 21 days ago
2010
IEEE
Linked open data (LOD), as provided by a quickly growing number of sources constitutes a wealth of easily accessible information. However, this data is not easy to understand. It i...
128
Voted
COLT
1993
Springer
15 years 6 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
129
Voted
EUROCOLT
1999
Springer
15 years 7 months ago
1999
Springer
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...