A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
Djamal Belazzougui, Fabiano C. Botelho, Martin Die...
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
One-class classification naturally only provides one-class of exemplars, the target class, from which to construct the classification model. The one-class approach is constructed...
Abstract— We present a systematic method for model reduction of a class of input-quantized systems in the max-plus algebra. We consider a generalization of the flow shop with ...
— In this paper, we investigate block-coded QAM constructed by multilevel coding for the noncoherent generalized likelihood ratio test (GLRT) detector. For the AWGN channel, we d...