732 search results - page 25 / 147 » Strongly Non-U-Shaped Learning Results by General Techniques |
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
In the problem of learning with positive and unlabeled examples, existing research all assumes that positive examples P and the hidden positive examples in the unlabeled set U are...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Piecewise planar models for stereo have recently become popular for modeling indoor and urban outdoor scenes. The strong planarity assumption overcomes the challenges presented by...
AAAI
1993
13 years 9 months ago
1993
Automating the construction of semantic grammars is a di cult and interesting problem for machine learning. This paper shows how the semantic-grammar acquisition problem can be vi...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
Protocols for information-hiding often use randomized primitives to obfuscate the link between the observables and the information to be protected. The degree of protection provide...