4894 search results - page 805 / 979 » The Guarding Problem - Complexity and Approximation |
MICCAI
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In this paper, we treat the problem of reducing the false positives (FP) in the automatic detection of colorectal polyps at Computer Aided Detection in Computed Tomograph...
IPMI
2007
Springer
14 years 9 months ago
2007
Springer
This paper presents a new method for constructing compact statistical point-based models of ensembles of similar shapes that does not rely on any specific surface parameterization....
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...