The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...
Andrew Walenstein, Rachit Mathur, Mohamed R. Chouc...
This paper addresses the problem of classifying observations when features are context-sensitive, especially when the testing set involves a context that is different from the tra...
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...