4112 search results - page 368 / 823 » Efficient Algorithms for the Spoonerism Problem |
233
click to vote
NIPS
2001
15 years 9 months ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
190
click to vote
JDA
2008
15 years 7 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
243
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
In this paper, we introduce a novel algorithm to solve
global shape registration problems. We use gray-scale “images”
to represent source shapes, and propose a novel twocompo...
178
click to vote
ICIP
2004
IEEE
16 years 9 months ago
2004
IEEE
Most digital cameras use filter arrays to sample red, green, and blue according to the Bayer pattern or similar ones. At each pixel only one color sample is taken and the values o...
171
click to vote
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
Group-Lasso estimators, useful in many applications, suffer from lack of meaningful variance estimates for regression coefficients. To overcome such problems, we propose a full Ba...