4255 search results - page 616 / 851 » On Learning Boolean Functions |
MLMI
2007
Springer
14 years 2 months ago
2007
Springer
This paper outlines first the BET method for task-based evaluation of meeting browsers. ‘Observations of interest’ in meetings are empirically determined by neutral observers ...
IROS
2006
IEEE
14 years 2 months ago
2006
IEEE
- Robot companions need to be able to constantly acquire knowledge about new objects for instance in order to detect them in the environment. This ability is necessary since it is ...
ACMICEC
2006
ACM
14 years 2 months ago
2006
ACM
Auction mechanism design has traditionally been a largely analytic process, relying on assumptions such as fully rational bidders. In practice, however, bidders often exhibit unkn...
COLT
2005
Springer
14 years 1 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...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...