2957 search results - page 499 / 592 » The Complexity of Polynomial-Time Approximation |
ICCV
1999
IEEE
14 years 2 days ago
1999
IEEE
This paper describes a new method for estimating the illumination distribution of a real scene from a radiance distribution inside shadows cast by an object in the scene. First, t...
CPM
1999
Springer
14 years 1 days ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
ICIP
1998
IEEE
14 years 1 days ago
1998
IEEE
: While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when ap...
COCO
1998
Springer
14 years 6 hour ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
3DIM
1997
IEEE
13 years 12 months ago
1997
IEEE
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit ...