1760 search results - page 91 / 352 » Learning from Partial Observations |
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
MSS
2008
IEEE
13 years 10 months ago
2008
IEEE
It is shown that preferences can be constructed from observed choice behavior in a way that is robust to indifferent selection (i.e., the agent is indifferent between two alternat...
ML
2006
ACM
13 years 10 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...
ICRA
2010
IEEE
13 years 8 months ago
2010
IEEE
— The goal of this research is to enable mobile robots to navigate through crowded environments such as indoor shopping malls, airports, or downtown side walks. The key research ...
CVPR
2011
IEEE
13 years 6 months ago
2011
IEEE
We develop a dictionary learning method which is (i) online, (ii) enables overlapping group structures with (iii) non-convex sparsity-inducing regularization and (iv) handles the ...