H Umeo, K Kubo, A Nomura - … Aspects of Computing–ICTAC 2017: 14th …, 2017 - Springer
The synchronization in ultra-fine-grained parallel computational model of cellular automata is known as the firing squad synchronization problem (FSSP) since its development, in …
This paper presents a generalized sufficient and necessary identifiability condition for second order statistics (SOS) based blind source separation (BSS). It is then shown that …
H Umeo - Reversibility and Universality: Essays Presented to …, 2018 - Springer
Synchronization of large-scale networks is an important and fundamental computing primitive in parallel and distributed systems. The synchronization in cellular automata …
S Wacker - arXiv preprint arXiv:1706.08429, 2017 - arxiv.org
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of left-homogeneous spaces are spheres, Euclidean spaces, as well as …
S Wacker - arXiv preprint arXiv:1706.05893, 2017 - arxiv.org
We construct a time-optimal quasi-solution of the firing mob synchronisation problem over finite, connected, and undirected multigraphs whose maximum degrees are uniformly …
H Umeo - 2012 IEEE 26th International Conference on …, 2012 - ieeexplore.ieee.org
Synchronization of large-scale networks is an important and fundamental computing primitive in parallel and distributed systems. The synchronization in cellular automata has …
H Umeo - Proceedings of the 4th WSEAS international …, 2010 - dl.acm.org
We study a firing squad synchronization problem that gives a finite-state protocol for synchronizing large-scale cellular automata. In this paper, we give a survey on recent …