3250 search results - page 184 / 650 » Parameterized Learning Complexity |
185
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
166
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
147
click to vote
ECAI
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we propose a novel classification algorithm that fits models of different complexity on separate regions of the input space. The goal is to achieve a balance betwee...
182
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
163
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
The requirements of real-world data mining problems vary extensively. It is plausible to assume that some of these requirements can be expressed as application-specific performan...