503 search results - page 30 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
121
click to vote
ICIP
2005
IEEE
15 years 9 months ago
2005
IEEE
We examine the problem of combining several images to remove occlusions that occur in one or more of a sequence of images. A sequence of digital camera images of a photoworthy lan...
139
Voted
CP
2008
Springer
15 years 4 months ago
2008
Springer
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
143
Voted
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
124
click to vote
DAC
1999
ACM
16 years 4 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
122
click to vote
TCS
2010
14 years 10 months ago
2010
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...