2107 search results - page 328 / 422 » Computing Small Search Numbers in Linear Time |
AI
2008
Springer
13 years 9 months ago
2008
Springer
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
CVPR
2003
IEEE
14 years 11 months ago
2003
IEEE
A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this...
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...