450 search results - page 44 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
FOCS
1993
IEEE
15 years 4 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
ICIP
2005
IEEE
16 years 1 months ago
2005
IEEE
We propose a very efficient numerical algorithm for minimizing certain curvature dependent functionals that appear in a variety of well known variational models of image processin...
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider the important challenge of recognizing a variety of deformable object classes in images. Of fundamental importance and particular difficulty in this setting is the pro...
109
click to vote
COMPGEOM
1998
ACM
15 years 4 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
115
click to vote
IROS
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper we address the joint problems of automated data acquisition and view planning for large–scale indoor and outdoor sites. Our method proceeds in two distinct stag...