291 search results - page 25 / 59 » Constraint Satisfaction: The Approximability of Minimization... |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
IPCO
2007
13 years 9 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
ICCV
2009
IEEE
15 years 20 days ago
2009
IEEE
In this paper we propose a robust visual tracking method
by casting tracking as a sparse approximation problem in a
particle filter framework. In this framework, occlusion, corru...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...