Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
DE, IPSJ-DBS |
2021-12-27 10:50 |
Online |
(Primary: Online, Secondary: On-site) |
Tree decomposition compression using tree grammar and query processing based on answer set programming Kazuyuki Kojima, Hiroyuki Seki (Nagoya Univ.) DE2021-16 |
Tree decomposition of a graph is an effective approach to solving problems for large graphs while the decomposition itse... [more] |
DE2021-16 pp.7-12 |
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 |
MSS, SS |
2019-01-16 09:50 |
Okinawa |
|
Extending Narrowing Trees to Basic Narrowing in Term Rewriting Yuya Maeda, Naoki Nishida, Masahiko Sakai, Tomoya Kobayashi (Nagoya Univ.) MSS2018-68 SS2018-39 |
Narrowing computation of a term rewriting system is an extension of rewriting by replacing matching with unification, wh... [more] |
MSS2018-68 SS2018-39 pp.73-78 |
SS, DC |
2017-10-19 14:15 |
Kochi |
Kochi City Culture-plaza CUL-PORT |
A Transformation Method of XQuery Expressions for Evaluation on Compressed XML Documents Jukiya Ogura, Yasunori Ishihara, Toru Fujiwara (Osaka Univ.) SS2017-23 DC2017-22 |
While XML documents can easily express data structure, there is a disadvantage that the document size becomes large. For... [more] |
SS2017-23 DC2017-22 pp.13-18 |
SS, KBSE, IPSJ-SE [detail] |
2017-07-19 10:20 |
Hokkaido |
|
Graph compression by tree grammars and direct evaluation of a node selection query on a compressed graph Takeshi Takeda, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) SS2017-1 KBSE2017-1 |
Graphs expressing relationships between real-world data tend to be extremely large, and researches on graph compression ... [more] |
SS2017-1 KBSE2017-1 pp.1-6 |
DC, SS |
2016-10-27 15:55 |
Shiga |
Hikone Kinro-Fukushi Kaikan Bldg. |
A Direct Update Method for XML Documents Including Data Values Compressed by Tree Grammars Ryunosuke Takayama, Kenji Hashimoto, Seki Hiroyuki (Nagoya Univ.) SS2016-27 DC2016-29 |
A tree grammar based compression is known as one of the compression methods for XML documents. Also, methods for updatin... [more] |
SS2016-27 DC2016-29 pp.55-60 |
LOIS |
2016-03-03 14:40 |
Okinawa |
Central Community Center, Miyakojima-City |
An Extension of Update Method without Decompression for Compressed Structured Documents and Its Experimental Evaluation Takeshi Goto, Ryunosuke Takayama, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) LOIS2015-75 |
XML is a {it de facto} standard for data storage and exchange, and various compression methods for XML documents have be... [more] |
LOIS2015-75 pp.69-74 |
MSS, SS |
2015-01-27 08:55 |
Tottori |
|
Direct Update of XML Documents Compressed by Tree Grammars Takeshi Goto (Nagoya Univ.), Takahiro Onoue (NAIST), Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) MSS2014-81 SS2014-45 |
XML is a de facto standard for data storage and exchange, and various compression methods for XML documents have been pr... [more] |
MSS2014-81 SS2014-45 pp.73-78 |
SS |
2014-10-23 16:15 |
Kochi |
Kochi city culture-plaza cul-port |
Query Evaluation and Update on XML Documents Compressed by Tree Grammars Takahiro Onoue (NAIST), Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ), Minoru Ito (NAIST) SS2014-28 |
XML documents often contain same repetitive substructures and various compression methods have been proposed. This paper... [more] |
SS2014-28 pp.17-22 |
PRMU |
2010-02-19 15:30 |
Tokyo |
Tokyo Univ. of Agriculture and Technology |
Development of a Path Search Method in Candiate Character Network Using Recursicve Transition Network. Toshikazu Takahashi, Takeshi Nagasaki, Masashi Koga (Hitachi) PRMU2009-231 |
We have developed a novel linguistical matching method (called "3.5 generation RTN matching") operated on context free g... [more] |
PRMU2009-231 pp.141-146 |
NLC |
2009-01-26 15:00 |
Okayama |
|
Automatic Construction of Augmented CFG from the Corpus with Dependency Structures Hozumi Tanaka, Ryosuke Nakanishi (Chukyo Univ.) NLC2008-73 |
There are two technologies of the natural language processing. One is called a rule-based method and the other one, a co... [more] |
NLC2008-73 pp.13-18 |
COMP |
2007-06-29 17:00 |
Hokkaido |
Hokkaido University |
Linear-Time Recognition of Tree Structures by Deterministic Linear Pushdown Tree Automata Akio Fujiyoshi (Ibaraki Univ.) COMP2007-30 |
In this paper, we introduce a deterministic linear pushdown tree automaton (deterministic L-PDTA) and some variations. I... [more] |
COMP2007-30 pp.93-99 |
AI |
2007-05-31 15:25 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Finding Common and Freqent Tree Pattern From Semi-Structured Texts Compressed by a Tree Grammar Compression Method Seiji Murakami, Koichiro Doi, Akihiro Yamamoto (Kyoto Univ.) AI2007-8 |
In this study, we present an algorithm that solves the problem of finding common tree patterns from semi-structured text... [more] |
AI2007-8 pp.39-44 |
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 |
PRMU, DE |
2005-06-17 14:50 |
Hokkaido |
Hokkaido Univ. |
Finding an Optimum Edit Script between an XML Document and a Regular Tree Grammar Nobutaka Suzuki (Univ. of Tsukuba) |
So far many algorithms for finding an optimum edit script between two XML documents have been proposed, but few studies ... [more] |
DE2005-25 PRMU2005-46 pp.69-74 |
DE, DC |
2004-10-19 14:00 |
Tokyo |
Tokyo Institute of Technology |
Schema update operations preserving the expressive power in XML databases Kenji Hashimoto, Yasunori Ishihara, Toru Fujiwara (Osaka Univ.) |
This paper proposes schema update operations preserving the expressive power in XML databases. In this paper, the inform... [more] |
DE2004-118 DC2004-33 pp.25-30 |