4131 search results - page 71 / 827 » The Generalized Max-Controlled Set Problem |
110
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
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...
127
click to vote
SIGIR
2008
ACM
15 years 2 months ago
2008
ACM
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
129
click to vote
NIPS
1996
15 years 4 months ago
1996
In the square linear blind source separation problem, one must nd a linear unmixing operator which can detangle the result xi(t) of mixing n unknown independent sources si(t) thro...
144
click to vote
CINQ
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
106
click to vote
TCBB
2008
15 years 2 months ago
2008
Under a stochastic model of molecular sequence evolution the probability of each possible pattern of characters is well defined. The Kimura's three-substitution-types (K3ST) m...