109 search results - page 11 / 22 » Geometric Duality in Multiple Objective Linear Programming |
JMMA
2002
13 years 7 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
PDPTA
1996
13 years 9 months ago
1996
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a novel human posture recognition method using convex programming based matching schemes. Instead of trying to segment the object from the background, we develop a nove...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We propose an approach to identify and segment objects from scenes that a person (or robot) encounters in Activities of Daily Living (ADL). Images collected in those cluttered sce...