3875 search results - page 216 / 775 » Approximation algorithms for the 0-extension problem |
221
click to vote
ESANN
2000
15 years 7 months ago
2000
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
180
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Statistical density estimation techniques are used in many computer vision applications such as object tracking, background subtraction, motion estimation and segmentation. The pa...
153
Voted
ICIP
2001
IEEE
16 years 7 months ago
2001
IEEE
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
175
click to vote
FSTTCS
2007
Springer
16 years 7 days ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
160
click to vote
COMPGEOM
2006
ACM
16 years 1 days ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...