Masafumi Koyama

According to our database, Masafumi Koyama authored at least 7 papers between 1996 and 2000.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2000

A fast and compact technique of implementing transition tables for finite state automata.

Masafumi Koyama, Masaki Oono, Kazuhiro Morita, Jun-ichi Aoe

Inf. Sci., 2000

Two improved access methods on compact binary (CB) trees.

Masami Shishibori, Masafumi Koyama, Makoto Okada, Jun-ichi Aoe

Inf. Process. Manag., 2000

1999

A link trie structure of storing multiple attribute relationships for natural language dictionaries.

Kazuhiro Morita, Masafumi Koyama, Masao Fuketa, Jun-Ichi Aoe

Int. J. Comput. Math., 1999

1998

A Substring search Algorithm in Extendible Hashing.

Hisatoshi Mochizuki, Masafumi Koyama, Masami Shishibori, Jun-ichi Aoe

Inf. Sci., 1998

A Fast Retrieving Algorithm of Hierarchical Relationships Using Trie Structures.

Masafumi Koyama, Kazuhiro Morita, Masao Fuketa, Jun-ichi Aoe

Inf. Process. Manag., 1998

An efficient retrieval algorithm for case structures using TRIE.

Masafumi Koyama, Krzysztof Morta, Shoji Mizobuchi, Jun-ichi Aoe

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

1996

The Time-Sliced Paradigm - A Connectionist Method for Continous Speech Recognition.

Ingrid Kirschning, Hideto Tomabechi, Masafumi Koyama, Jun-Ichi Aoe

Inf. Sci., 1996