| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| IT | 2022-07-21 14:55 |
Okayama | Okayama University of Science (Primary: On-site, Secondary: Online) |
A Data Compression Method Where The Codeword Is a Computer Program Generating The Data Mitsuharu Arimura (Shonan Inst. Tech.)  IT2022-19 |
The Kolmogorov complexity of a string is defined as the shortest length of the program on a Turing machine used to repre... [more] | IT2022-19 pp.18-23 |
| PRMU, IPSJ-CVIM | 2022-03-11 10:15 |
Online | Online | Context free grammar with tree structure analysis for online handwritten mathematical expression recognition Naruki Kitashima, Cuong Tuan Nguyen, Ikuko Shimizu, Masaki Nakagawa (TUAT) PRMU2021-76 |
In mathematics exams, descriptive questions are effective for measuring the comprehension of examinees, but marking hand... [more] | PRMU2021-76 pp.103-108 |
| COMP | 2022-03-06 10:00 |
Online | Online | An Ambiguity Hierarchy of Weighted Context-free Grammars Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) COMP2021-31 |
Weighted context-free grammar (WCFG) is a quantitative extension of context-free grammar (CFG). It is known that unambig... [more] | COMP2021-31 pp.1-7 |
| SS | 2021-03-03 10:00 |
Online | Online | Weighted Multiple Context-free Grammars and their Properties Yusuke Inoue, Hiroyuki Seki (Nagoya Univ.) SS2020-28 |
Multiple context-free grammar (MCFG) is an extension of context-free grammar that generates tuples of strings. MCFG has ... [more] | SS2020-28 pp.1-6 |
| MSS, SS | 2021-01-27 15:25 |
Online | Online | Pumping Lemmas for Languages Expressed by Computational Models with Registers Rindo Nakanishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) MSS2020-41 SS2020-26 |
Register automaton (RA), register context-free grammar (RCFG), and register tree automaton (RTA) are computational model... [more] | MSS2020-41 SS2020-26 pp.72-77 |
| SS, MSS | 2018-01-18 14:15 |
Hiroshima | Computational Complexity of Membership and Emptiness Problems for Register Context-Free Grammars Ryoma Senda, Hiroyuki Seki (Nagoya Univ.) MSS2017-54 SS2017-41 |
Register context-free grammar (RCFG) is an extension of context-free grammar to handle data values. RCFGs can be applied... [more] | MSS2017-54 SS2017-41 pp.41-46 |
|
| TL | 2016-07-24 13:45 |
Tokyo | Waseda Univ. (Nishi-Waseda Campus) | Computational modeling of hierarchical morphological structures Yohei Oseki, Alec Marantz (NYU) TL2016-24 |
Chomsky (1956, 1957) famously showed that sentences are organized as hierarchical structures, not linear strings, of wor... [more] | TL2016-24 pp.65-69 |
| SWIM | 2015-05-23 15:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Generalized Service Process Expressed by Context-Free Grammar Fumihiro Maruyama (Fujitsu Labs) SWIM2015-4 |
In this paper we generalize processes for various services and define a generalized service process (GSP) with the follo... [more] | SWIM2015-4 pp.17-22 |
| COMP | 2013-12-21 14:55 |
Okinawa | Okinawa Industry Support Center | On alternation-bounded alternating context-free grammars and languages Etsuro Moriya (Waseda Univ.) COMP2013-56 |
Alternating context-free grammars, in which the number of alternations between existential and universal modes is bounde... [more] | COMP2013-56 pp.107-114 |
| COMP, IPSJ-AL | 2012-05-14 15:15 |
Ehime | Ehime University | On Context-free Languages That Cannot Be Recognized by Limited Backtrack Top-down Parsers Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2012-11 |
Recently, deterministic parsing with bounded lookahead and limited backtrack top-down parsing have been used for parsing... [more] | COMP2012-11 pp.45-50 |
| COMP | 2011-04-22 09:30 |
Kyoto | Kyoto University | A construction method for non-left-recursive parsing expression grammars Shunichi Matsubara, Shojiro Ogawa, Marin J. Duerst (Aoyama Gakuin Univ.) COMP2011-1 |
Parsing expression grammars (PEGs) have recently been used to describe the syntax of artificial languages such as progra... [more] | COMP2011-1 pp.1-8 |
| IT | 2008-09-11 14:30 |
Okinawa | Culture Resort Festone (Okinawa) | An Improvement for Lossless Data Compression Based on Grammatical Inference Bayu Yudistira, Koji Iwanuma, Hidetomo Nabeshima (Univ of Yamanashi) IT2008-22 |
Recently, the research on grammatical-inference data compression method has been done actively, such as Sequitur algorit... [more] | IT2008-22 pp.13-18 |
| PRMU | 2008-02-22 09:00 |
Ibaraki | Univ. of Tsukuba | Online Handwritten Kanji String Recognition Based on Grammar Description of Character Structures Ikumi Ota, Ryo Yamamoto, Takuya Nishimoto, Shigeki Sagayama (Univ. of Tokyo) PRMU2007-227 |
In this paper, we discuss a method for online handwritten Kanji character recognition by describing the structure of Kan... [more] | PRMU2007-227 pp.75-80 |
| IT | 2007-11-27 14:50 |
Mie | Kashikojima Hojoen (Shima) | [Invited Talk]
RNA Secondary Structure Prediction Based on Formal Grammars Yuki Kato (Kyoto Univ.), Hiroyuki Seki (NAIST), Tatsuya Akutsu (Kyoto Univ.) IT2007-21 |
Recently, much attention has been paid to RNA secondary structure prediction that applies parsing techniques in formal g... [more] | IT2007-21 pp.7-16 |
| PRMU | 2007-03-16 10:00 |
Okayama | Making On-Line Handwritten Mathematical Expression Database Using Stroke-Based Stochastic Context-Free Grammar Ryo Yamamoto, Shinji Sako, Takuya Nishimoto, Shigeki Sagayama (Tokyo University) |
In this paper, we built an on-line handwritten mathematical expression database for evaluation and training of mathemati... [more] | PRMU2006-257 pp.13-17 |
|
| COMP | 2006-10-17 13:40 |
Miyagi | Tohoku University | On the Generative Power of Multiple Context-Free Grammars and Macro Grammars Hiroyuki Seki, Yuki Kato (NAIST) |
Several grammars of which generative power is between context-free grammar and context-sensitive grammar were proposed. ... [more] |
COMP2006-36 pp.41-48 |
| SS | 2006-08-04 11:00 |
Hokkaido | Hokkaido University | An Efficient Model Checking Method for Programs with History-based Access Control Jing Wang, Yoshiaki Takata, Hiroyuki Seki (NAIST) |
我々は、実行履歴に基づくアクセス制御を含む再帰プログラムの形式モデルHBACプログラムを提案し、HBACプログラムのモデル検査法について考察してきた。本発表では、提案するモデル検査法におけるいくつかの最適化手法を述べる。また、実装した検証ツ... [more] | SS2006-38 pp.23-28 |
| PRMU, TL | 2006-02-24 15:00 |
Ibaraki | Stroke-Based Stochastic Context-Free Grammar for On-line Handwritten Mathematical Expression Recognition Ryo Yamamoto, Shinji Sako, Takuya Nishimoto, Shigeki Sagayama (Tokyo Univ.) |
In this paper, we propose a new framework for on-line handwriting mathematical expression recognition.In this approach, ... [more] | TL2005-86 PRMU2005-221 pp.111-116 |
|
| IT | 2004-07-28 15:55 |
Chiba | Tokyo Univ. (Kashiwa) | Performance Evaluation of Data Compression Algorithms Based on the Greedy Grammar Transform Naoki Koizumi, Hiroki Koga (Univ. of Tsukuba) |
The universal data compression algorithm based on the greedy-grammar transform, which was proposed by Yang and Kieffer,... [more] |
IT2004-13 pp.29-34 |
[Return to Top Page]