2255 search results - page 112 / 451 » Computing a Center-Transversal Line |
ICCS
2003
Springer
15 years 4 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
CSE
2007
IEEE
14 years 11 months ago
2007
IEEE
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
77
Voted
CVPR
1999
IEEE
16 years 1 months ago
1999
IEEE
We o er a simple paradigm for tting models, parametric and non-parametric, to noisy data, which resolves some of the problems associated with classic MSE algorithms. This is done ...
CVPR
2000
IEEE
16 years 1 months ago
2000
IEEE
We consider a scene, containing many objects moving with constant velocity along straight line paths, seen from three reference viewpoints at three different times.The scene may e...