1622 search results - page 118 / 325 » Learning a Hidden Matching |
153
click to vote
ICRA
2003
IEEE
15 years 8 months ago
2003
IEEE
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...
137
Voted
ECML
2006
Springer
15 years 7 months ago
2006
Springer
Multiple-instance learning (MIL) is a popular concept among the AI community to support supervised learning applications in situations where only incomplete knowledge is available....
140
click to vote
NIPS
2007
15 years 4 months ago
2007
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
110
click to vote
UAI
2003
15 years 4 months ago
2003
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
139
click to vote
ML
2006
ACM
15 years 3 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...