4110 search results - page 282 / 822 » Efficient algorithms for the 2-gathering problem |
198
click to vote
NIPS
2001
15 years 8 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. ...
166
click to vote
JDA
2008
15 years 6 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, ...
160
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We address the problem of efficiently estimating the rotation of a camera relative to the canonical 3D Cartesian frame of an urban scene, under the so-called "Manhattan World&...
181
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
Reliable transmission of video over wireless networks must address the limited bandwidth and the possibility of loss. When the bandwidth is insufficient on a single channel, the v...
278
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...