109 search results - page 11 / 22 » Geometric Duality in Multiple Objective Linear Programming |
111
click to vote
JMMA
2002
14 years 11 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...
101
click to vote
PDPTA
1996
15 years 1 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
15 years 5 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
15 years 5 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...
126
click to vote
ICCV
2011
IEEE
13 years 11 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...