656 search results - page 41 / 132 » Complexity of finite-horizon Markov decision process problem... |
120
click to vote
IUI
2010
ACM
15 years 10 months ago
2010
ACM
Most of the previous work on non-invasive brain-computer interfaces (BCIs) has been focused on feature extraction and classification algorithms to achieve high performance for the...
128
click to vote
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
115
click to vote
ICASSP
2008
IEEE
15 years 8 months ago
2008
IEEE
—We aim to characterize the maximum link throughput of a multi-channel opportunistic communication system. The states of these channels evolve as independent and identically dist...
114
click to vote
ICMLA
2008
15 years 3 months ago
2008
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...
112
click to vote
ICIAP
2001
Springer
16 years 2 months ago
2001
Springer
In Computer Vision, two-dimensional shape classifcation is a complex and well studied topic, often basic for three-dimensional object recognition. Object contours are a widely cho...