182 search results - page 34 / 37 » A Theory of Strict P-completeness |
ENTCS
2007
13 years 7 months ago
2007
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we mo...
SIAMCOMP
2008
13 years 7 months ago
2008
Abstract. The Perceptron algorithm, despite its simplicity, often performs well in online classification tasks. The Perceptron becomes especially effective when it is used in conju...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
NIPS
2000
13 years 9 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...