4255 search results - page 149 / 851 » On Learning Boolean Functions |
MCS
2005
Springer
15 years 3 months ago
2005
Springer
We study how the error of an ensemble regression estimator can be decomposed into two components: one accounting for the individual errors and the other accounting for the correlat...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
We present a learning algorithm for nominal data. It builds a classifier by adding iteratively a simple patch function that modifies the current classifier. Its main advantage lies...
COLT
2005
Springer
15 years 3 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
ASPDAC
2005
ACM
15 years 18 hour ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
101
click to vote
BIRTHDAY
2004
Springer
15 years 1 months ago
2004
Springer
The discussions about learning management systems and reusable learning objects primarily focus on technical standardization issues. Standards such as SCORM or LTSC-LOM will yield...