Sciweavers

44 search results - page 2 / 9
» Optimal Rectangle Packing: New Results
Sort
View
VTS
2002
IEEE
126views Hardware» more  VTS 2002»
13 years 10 months ago
On Using Rectangle Packing for SOC Wrapper/TAM Co-Optimization
The testing time for a system-on-chip (SOC) is determined to a large extent by the design of test wrappers and the test access mechanism (TAM). Wrapper/TAM co-optimization is ther...
Vikram Iyengar, Krishnendu Chakrabarty, Erik Jan M...
ISPD
1999
ACM
112views Hardware» more  ISPD 1999»
13 years 9 months ago
Arbitrary convex and concave rectilinear block packing using sequence-pair
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
Kunihiro Fujiyoshi, Hiroshi Murata
IV
2008
IEEE
119views Visualization» more  IV 2008»
13 years 11 months ago
CAT: A Hierarchical Image Browser Using a Rectangle Packing Technique
The recent revolution of digital camera technology has resulted in much larger collections of images. Image browsing techniques thus become increasingly important for overview and...
Ai Gomi, Reiko Miyazaki, Takayuki Itoh, Jia Li
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
13 years 12 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
TCS
2010
13 years 3 months ago
Tight results for Next Fit and Worst Fit with resource augmentation
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
Joan Boyar, Leah Epstein, Asaf Levin