44 search results - page 6 / 9 » Maximizing the Number of Packed Rectangles |
129
Voted
EUROPAR
2010
Springer
15 years 3 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
143
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
166
Voted
EOR
2007
15 years 3 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
125
Voted
IDA
2005
Springer
15 years 9 months ago
2005
Springer
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
142
Voted
GMP
2008
IEEE
15 years 10 months ago
2008
IEEE
Surface parameterization is a fundamental tool in geometric modeling and processing. Most existing methods deal with simply connected disks. This work introduces a novel method to ...