2957 search results - page 391 / 592 » The Complexity of Polynomial-Time Approximation |
191
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
194
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Scenes with cast shadows can produce complex sets of
images. These images cannot be well approximated by lowdimensional
linear subspaces. However, in this paper we
show that the...
142
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
The problem of binarization of gray level images acquired under nonuniform illumination is reconsidered. Yanowitz and Bruckstein proposed to use for image binarization an adaptive...
194
click to vote
ICCV
2001
IEEE
16 years 8 months ago
2001
IEEE
Robust, real-time tracking of objects from visual data requires probabilistic fusion of multiple visual cues. Previous approaches have either been ad hoc or relied on a Bayesian n...
196
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
Abstract. We present a method for learning feature descriptors using multiple images, motivated by the problems of mobile robot navigation and localization. The technique uses the ...