We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
This paper deals with some detection issues of watermark signals. We propose an easy way to implement an informed watermarking embedder whatever the detection function. This metho...
Teddy Furon, Benoit M. Macq, Neil J. Hurley, Gueno...
Abstract. In this paper we study colored nonogram solving using Integer Linear Programming. Our approach generalizes the one used by Robert A. Bosch which was developed for black a...
—In this treatise, we propose a novel serial concatenated RSC-coded Irregular Precoded Linear Dispersion Codes (IR-PLDC), which is capable of operating near MIMO channel’s capa...