2661 search results - page 52 / 533 » Quantum Complexity Classes |
ECML
1993
Springer
15 years 4 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
104
Voted
DM
2007
15 years 20 days ago
2007
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
80
Voted
IPL
2008
15 years 21 days ago
2008
We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...
120
Voted
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Model selection in unsupervised learning is a hard problem. In this paper a simple selection criterion for hyperparameters in one-class classifiers (OCCs) is proposed. It makes us...
100
Voted
EJC
2006
15 years 21 days ago
2006
We introduce a large self-dual class of simplicial complexes for which we show that each member complex is contractible or homotopy equivalent to a sphere. Examples of complexes i...