36320 search results - page 478 / 7264 » From Code to Models |
186
click to vote
ICONIP
2009
15 years 4 months ago
2009
It is generally assumed in the traditional formulation of supervised learning that only the outputs data are uncertain. However, this assumption might be too strong for some learni...
163
click to vote
NIPS
2001
15 years 8 months ago
2001
We propose the framework of mutual information kernels for learning covariance kernels, as used in Support Vector machines and Gaussian process classifiers, from unlabeled task da...
193
click to vote
IJCAI
1993
15 years 8 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
298
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
199
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Currently there are many service providers on the Web. Industry recognizes that from Web services many different business applications can be quickly created. A Web servi...