12519 search results - page 261 / 2504 » Approximation Problems Categories |
199
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
190
click to vote
TON
2010
15 years 5 months ago
2010
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
177
click to vote
FOIKS
2008
Springer
15 years 8 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
192
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
To learn a new visual category from few examples, prior knowledge from unlabeled data as well as previous related categories may be useful. We develop a new method for transfer le...
161
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...