The paper deals with the numerical solution of inverse Sturm-Liouville problems with unknown potential symmetric over the interval [0, ]. The proposed method is based on the use o...
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little ...
Peter van Liesdonk, Saeed Sedghi, Jeroen Doumen, P...