3250 search results - page 272 / 650 » Parameterized Learning Complexity |
165
click to vote
PKDD
2009
Springer
16 years 21 days ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
138
click to vote
MICAI
2007
Springer
16 years 9 days ago
2007
Springer
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...
142
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Recurrent neural networks are theoretically capable of learning complex temporal sequences, but training them through gradient-descent is too slow and unstable for practical use i...
152
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
158
click to vote
CHI
1998
ACM
15 years 10 months ago
1998
ACM
We explore some of the complex issues surrounding the design and use of multimedia and Internet-based learning resources in distance education courses. We do so by analysing our e...