5595 search results - page 290 / 1119 » Approximation Algorithms for Clustering Problems |
185
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...
161
click to vote
ICIP
2001
IEEE
16 years 8 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...
186
click to vote
FSTTCS
2007
Springer
16 years 25 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...
169
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
176
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...