Sciweavers

STOC
2012
ACM
217views Algorithms» more  STOC 2012»
11 years 7 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
IEEEPACT
1998
IEEE
13 years 9 months ago
Efficient Methods for Multi-Dimensional Array Redistribution
In this paper, we present efficient methods for multidimensional array redistribution. Based on the previous work, the basic-cycle calculation technique, we present a basic-block ...
Yeh-Ching Chung, Ching-Hsien Hsu
FPT
2005
IEEE
117views Hardware» more  FPT 2005»
13 years 10 months ago
FPGA Defect Tolerance: Impact of Granularity
As device sizes shrink, FPGAs are increasingly prone to manufacturing defects. The ability to tolerate multiple defects is anticipated to be very important at 45nm and beyond. One...
Anthony J. Yu, Guy G. Lemieux