Sauer's Lemma is extended to classes HN of binary-valued functions h on [n] = {1, . . . , n} which have a margin less than or equal to N on all x [n] with h(x) = 1, where th...
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
The purpose of this two-part monograph is to present a tutorial on set partition coding, with emphasis and examples on image wavelet transform coding systems, and describe their u...
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...