| 2006 | ||
|---|---|---|
| j5 | Hirofumi Nakamura, Sadayuki Murashima: A Code Whose Codeword Length is Shorter than log2* n in Almost All of Sufficiently Large Positive Integers. IEICE Transactions 89-A(4): 1132-1139 (2006) | |
| c1 | Ke Zhang, Sadayuki Murashima: The Perfect Recalling Rate of Morphological Associative Memory. ICONIP (1) 2006: 537-546 | |
| 2005 | ||
| j4 | Takayasu Fuchida, Masayuki Kashima, Hirofumi Nakamura, Kunihiko Mori, Sadayuki Murashima: Constructing three-dimensional discrete Voronoi diagrams by the incremental method and application to self-organizing maps. Systems and Computers in Japan 36(5): 55-67 (2005) | |
| 2002 | ||
| j3 | Toshihiro Ida, Syuji Ueda, Masayuki Kashima, Takayasu Fuchida, Sadayuki Murashima: On a method to decide kernel patterns of morphological associative memory. Systems and Computers in Japan 33(7): 85-94 (2002) | |
| 2001 | ||
| j2 | Kunihiko Mori, Jun-ichi Minamimoto, Takayasu Fuchida, Sadayuki Murashima: One-dimensional resolution improvement of images in time series by genetic algorithm. Systems and Computers in Japan 32(7): 12-19 (2001) | |
| 1992 | ||
| j1 | Sadayuki Murashima, Takayasu Fuchida: Search for the minimum value via the multitransition neural network. Systems and Computers in Japan 23(3): 49-61 (1992) | |
| 1 | Takayasu Fuchida | |
| 2 | Toshihiro Ida | |
| 3 | Masayuki Kashima | |
| 4 | Jun-ichi Minamimoto | |
| 5 | Kunihiko Mori | |
| 6 | Hirofumi Nakamura | |
| 7 | Syuji Ueda | |
| 8 | Ke Zhang |
Data released under the ODC-BY 1.0 license — See also our legal information page