In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
This paper presents Dragon, a new stream cipher constructed using a single word based non-linear feedback shift register and a nonlinear filter function with memory. Dragon uses a ...
Kevin Chen, Matthew Henricksen, William Millan, Jo...
We extend multiclass SVM to multiple prototypes per class. For this framework, we give a compact constrained quadratic problem and we suggest an efficient algorithm for its optimi...
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game theory has been used in networks to share resources fairly. Due to its many appealing propertie...