7978 search results - page 850 / 1596 » Combining shared-coin algorithms |
237
click to vote
NIPS
2004
15 years 9 months ago
2004
An important aspect of clustering algorithms is whether the partitions constructed on finite samples converge to a useful clustering of the whole data space as the sample size inc...
226
click to vote
NIPS
2001
15 years 9 months ago
2001
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
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. ...
157
click to vote
UAI
2001
15 years 9 months ago
2001
In this paper, we present an efficient algorithm for performing stepwise selection in the class of decomposable models. We focus on the forward selection procedure, but we also di...
207
click to vote
SODA
2004
ACM
15 years 9 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...