Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("AOE J")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 24 of 24

  • Page / 1
Export

Selection :

  • and

PRACTICAL METHOD FOR REDUCING PRECEDENCE PARSERSAOE J; YAMAMOTO Y; SHIMADA R et al.1978; SYST., COMPUT., CONTROLS; ISSN 0096-8765; USA; DA. 1978 PUBL. 1980; VOL. 9; NO 3; PP. 54-62; BIBL. 15 REF.Article

A PRACTICAL METHOD FOR REDUCING WEAK PRECEDENCE PARSERSAOE J; YAMAMOTO Y; SHIMADA R et al.1983; IEEE TRANSACTIONS ON SOFTWARE ENGINEERING; ISSN 0098-5589; USA; DA. 1983; VOL. 9; NO 1; PP. 25-30; BIBL. 17 REF.Article

PRACTICAL METHOD FOR OPTIMIZING LR (K) PARSER USING MATRIX STRUCTUREAOE J; YAMAMOTO Y; SHIMADA R et al.1979; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1979 PUBL. 1981; VOL. 10; NO 4; PP. 1-10; BIBL. 18 REF.Article

A method for the expansion and contraction of text's size by using the string replacement algorithmTSUDA, K; AOE, J.-I.Information sciences. 1995, Vol 87, Num 1-3, pp 47-64, issn 0020-0255Article

PRACTICAL METHOD FOR REDUCING SPARSE MATRICES WITH INVARIANT ENTRIESAOE J; FUKUOKA I; YAMAMOTO Y et al.1980; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1980 PUBL. 1982; VOL. 11; NO 6; PP. 68-77; BIBL. 10 REF.Article

Improvement of binary digital search trees using hierarchical structuresSHISHIBORI, M; KIYOHARA, S; AOE, J.-I et al.Systems and computers in Japan. 1997, Vol 28, Num 2, pp 86-95, issn 0882-1666Article

A robust method for understanding NL interface commands in the ICI intelligent command interpreterMIMA, H; ANDO, K; AOE, J et al.Information sciences. 1995, Vol 85, Num 1-3, pp 185-198, issn 0020-0255Article

Non binary arithmetic AN codes using odd radix expressionsSHIMADA, R; OHKURA, Y; AOE, J et al.IEEE transactions on computers. 1985, Vol 34, Num 11, pp 1050-1056, issn 0018-9340Article

A method for understanding intentions of indirect speech acts in natural language interfacesMIMA, H; AOE, J; FUKETA, M et al.Systems and computers in Japan. 1996, Vol 27, Num 1, pp 77-91, issn 0882-1666Article

Word category prediction based on neural networkNAKAMURA, M; TSUDA, K; AOE, J.-I et al.International journal of computer mathematics. 1995, Vol 57, Num 3-4, pp 169-181, issn 0020-7160Article

A method of compressing trie structuresMORIMOTO, K; IRIGUCHI, H; AOE, J.-I et al.Software, practice & experience. 1994, Vol 24, Num 3, pp 265-288, issn 0038-0644Article

A new approach to phoneme recognition by phoneme filter neural networksNAKAMURA, M; TSUDA, K; AOE, J.-I et al.Information sciences. 1996, Vol 90, Num 1-4, pp 109-119, issn 0020-0255Article

An algorithm for compressing common sulfixes used in trie structuresAOE, J.-I; MORIMOTO, K; HASE, M et al.Systems and computers in Japan. 1993, Vol 24, Num 12, pp 31-42, issn 0882-1666Article

Improvement of lookahead solution for stack-controlling LALR (1) parsersAOE, J; YAMAMOTO, Y; SHIMADA, R et al.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1985, Vol 68, Num 9, pp 575-578, issn 0387-236XArticle

An efficient method for storing and retrieving finite state machinesAOE, J; YAMAMOTO, Y; SHIMADA, R et al.Systems, computers, controls. 1982, Vol 13, Num 6, pp 1-8, issn 0096-8765Article

Two improved access methods on compact binary (CB) treesSHISHIBORI, M; KOYAMA, M; OKADA, M et al.Information processing & management. 2000, Vol 36, Num 3, pp 379-399, issn 0306-4573Article

A fast method of determining weighted compound keywords from text databasesFUKETA, M; MIZOFUCHI, S; HAYASHI, Y et al.Information processing & management. 1998, Vol 34, Num 4, pp 431-442, issn 0306-4573Article

The time-sliced paradigm : A connectionist method for continuous speech recognitionKIRSCHNING, I; TOMABECHI, H; KOYAMA, M et al.Information sciences. 1996, Vol 93, Num 1-2, pp 133-158, issn 0020-0255Article

Similarity measurement using term negative weight and its application to word similarityATLAM, E.-S; FUKETA, M; MORITA, K et al.Information processing & management. 2000, Vol 36, Num 5, pp 717-736, issn 0306-4573Article

A link trie structure of storing multiple attribute relationships for natural language dictionariesMORITA, K; KOYAMA, M; FUKETA, M et al.International journal of computer mathematics. 1999, Vol 72, Num 4, pp 463-476, issn 0020-7160Article

An efficient method for storing and retrieving graph structuresIRIGUCHI, H; TSUDA, K; SHISHIBORI, M et al.Systems and computers in Japan. 1997, Vol 28, Num 3, pp 43-51, issn 0882-1666Article

HH-type cyclic ST-AN codesSHIMADA, R; YAMAMOTO, Y; AOE, J et al.Systems, computers, controls. 1984, Vol 15, Num 2, pp 1-10, issn 0096-8765Article

A trie compaction algorithm for a large set of keysAOE, J.-I; MORIMOTO, K; SHISHIBORI, M et al.IEEE transactions on knowledge and data engineering. 1996, Vol 8, Num 3, pp 476-491, issn 1041-4347Article

An efficient trie construction for natural language dictionariesSUMITOMO, T; MORITA, K; FUKETA, M et al.International journal of computer mathematics. 2002, Vol 79, Num 6, pp 703-713, issn 0020-7160Article

  • Page / 1