New insights have been gained recently into the interplay between complex network architectures and the collective dynamics of simple elements coupled through them. The usual parad...
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Abstract— We propose a new method for collecting information on regulatory elements found by any motif discovery program. We suggest that combining the results of n leave-oneout ...
Most of the existing 3D engines are overwhelmingly complex and do not integrate support for virtual characters. We have developed a teaching oriented 3D engine with support for su...