3791 search results - page 18 / 759 » Packing sets of patterns |
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
We prove that Best Fit bin packing has linear waste on the discrete distribution Ufj kg (where items are drawn uniformly from the set f1=k 2=3 j=kg) for sufficiently large k when...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
1 This paper presents a test scheduling approach for system-onchip production tests with peak-power constraints. An abort-onfirst-fail test approach is assumed, whereby the test is...
ICCV
2009
IEEE
15 years 11 days ago
2009
IEEE
One of the main limitations of image search based on
bag-of-features is the memory usage per image. Only a few
million images can be handled on a single machine in rea-
sonable ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...