455 search results - page 46 / 91 » Approximation Algorithms for Partial Covering Problems |
80
Voted
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
ALGORITHMICA
1999
14 years 9 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
COCOA
2009
Springer
15 years 28 days ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...