Document binarization is an active research area for many years. There are many difficulties associated with satisfactory binarization of document images and especially in cases o...
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
Abstract— In this paper, we answer the question that “Can conventional differential unitary space time modulation (DUSTM) be applied when there is an unknown carrier frequency ...
Tao Cui, Feifei Gao, Arumugam Nallanathan, Chintha...