116 search results - page 4 / 24 » Bounds for online bounded space hypercube packing |
34
Voted
DAM
1998
14 years 9 months ago
1998
We show a natural graph-theoretic generalization of the Sauer–Shelah lemma. This result is applied to bound the ‘∞ and L1 packing numbers of classes of functions whose range...
IWANN
2009
Springer
15 years 2 months ago
2009
Springer
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
65
Voted
VTC
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— In this paper we consider serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) combined with precoded Differential Space-Time Spreadin...
DISOPT
2008
14 years 9 months ago
2008
We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, whe...
73
Voted
JCSS
2006
14 years 9 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...