In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
Visualising computational simulation models of solid state physical systems is a hard problem for dense lattice models. Fly throughs and cutaways can aid viewer understanding of a...
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi ...