The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
We propose and investigate the notion of aggregate message authentication codes (MACs) which have the property that multiple MAC tags, computed by (possibly) different senders on ...
In some application domains, such as medical imaging, the objects that compose the scene are known as well as some of their properties and their spatial arrangement. We can take ad...
Olivier Nempont, Jamal Atif, Elsa D. Angelini, Isa...
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site ...
Michael A. Bekos, Michael Kaufmann, Antonios Symvo...
Radial basis function network (RBF) kernels are widely used for support vector machines (SVMs). But for model selection of an SVM, we need to optimize the kernel parameter and the ...