| 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, RCS, SIP | 2023-01-24 10:25 |
Gunma | Maebashi Terrsa (Primary: On-site, Secondary: Online) |
An improved context tree switching method by dynamic expansion and pruning of context tree Masaya Ootsu, Hideki Yagi (UEC)  IT2022-36 SIP2022-87 RCS2022-215 |
The Context Tree Weighting (CTW) method is a sequential lossless universal coding algorithm for tree sources with good p... [more] | IT2022-36 SIP2022-87 RCS2022-215 pp.42-47 |
| 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 |
| WBS, IT, ISEC | 2021-03-04 10:55 |
Online | Online | An Efficient Bayes Coding Algorithm for the Source Based on Context Tree Models that Vary from Section to Section Koshi Shimada, Shota Saito, Toshiyasu Matsushima (Waseda Univ.) IT2020-115 ISEC2020-45 WBS2020-34 |
In this paper, we present an efficient coding algorithm for a non-stationary source based on context tree models that ve... [more] | IT2020-115 ISEC2020-45 WBS2020-34 pp.19-24 |
| IT | 2017-11-28 16:35 |
Niigata | Hotel Shiratama-no-Yu Senkei | [Invited Talk]
AIFV Codes and Their Extended Codes Hirosuke Yamamoto (Univ. of Tokyo) IT2017-54 |
In source coding based on a code tree, it was concluded from Kraft's and McMilan's theorems that the Huffman code is t... [more] |
IT2017-54 pp.19-26 |
| SS, DC | 2017-10-19 13:45 |
Kochi | Kochi City Culture-plaza CUL-PORT | A Direct Update Method for Compressed Data with Top Tree Suguru Nishimura, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) SS2017-22 DC2017-21 |
This paper proposes a direct update method for a data compressed with top tree. For a given compressed data (top DAG) an... [more] | SS2017-22 DC2017-21 pp.7-12 |
| 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 |
|
| COMP, ISEC | 2016-12-22 10:30 |
Hiroshima | Hiroshima University | [Invited Talk]
Theory and Practice of Succinct Data Structures Kunihiko Sadakane (Univ. of Tokyo) ISEC2016-82 COMP2016-43 |
Succinct data structures are data structures that can compress data to the limit and perform search and other operations... [more] | ISEC2016-82 COMP2016-43 p.71 |
| 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 |
| KBSE, SS, IPSJ-SE [detail] | 2016-07-14 12:40 |
Hokkaido | A Method of Tree Compression with Top Trees and Direct Query Evaluation Suguru Nishimura, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) SS2016-10 KBSE2016-16 |
Tree compression methods that utilize the structural information have the advantage that a compressed document can be di... [more] | SS2016-10 KBSE2016-16 pp.93-98 |
|
| 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 |
| IT | 2013-07-25 14:30 |
Tokyo | Nishi-Waseda campus, Waseda University | A Data Compression Scheme based on Reduplicative Parsing for Binary Sources Shigeru Maya, Hirosuke Yamamoto (Univ. of Tokyo) IT2013-14 |
The incremental parsing used in the LZ78 code can be implemented by the incremental parsing tree, and Yokoo showed that... [more] |
IT2013-14 pp.17-22 |
| NLP | 2013-07-09 15:20 |
Okinawa | Miyako Island Marine Terminal | Lossless Image Data Compression Based on Regression Trees Manabu Kobayashi (Shonan Inst. of Tech.), Shigeichi Hirasawa (Waseda Univ.) NLP2013-47 |
It is well known that the random forests proposed by L. Breiman in 2001 achieve the high accuracy for classification pro... [more] | NLP2013-47 pp.117-122 |
| NC, NLP | 2013-01-24 13:10 |
Hokkaido | Hokkaido University Centennial Memory Hall | Text Classification Using Context-Tree Weighting Algorithm for Semi-Supervised Leaning Tomohiro Obata, Manabu Kobayashi, Yoshihiko Sakashita (Shonan Inst. of Tech.) NLP2012-112 NC2012-102 |
The Text Classification problem has been investigated by various techniques, such as a vector space model, a support vec... [more] | NLP2012-112 NC2012-102 pp.49-53 |
| NLP | 2011-11-11 09:10 |
Okinawa | Miyako Island Marine Terminal | Text Classification Using Context-Tree Weighting Algorithm Tomohiro Obata, Hiroyuki Ikegami, Manabu Kobayashi, Yoshihiko Sakashita (SIT) NLP2011-110 |
The Text Classification problem has been investigated by various techniques, such as a vector space model, a support vec... [more] | NLP2011-110 pp.103-108 |
| NLP | 2011-11-11 09:35 |
Okinawa | Miyako Island Marine Terminal | An Error Probability Analysis of the Text Classification Using the CTW Algorithm Manabu Kobayashi (SIT), Masayuki Goto, Toshiyasu Matsushima (Waseda Univ.), Shigeichi Hirasawa (Cyber Univ.) NLP2011-111 |
The text classification problem has been investigated by various techniques, such as a vector space model, a support vec... [more] | NLP2011-111 pp.109-114 |
| IBISML | 2011-03-28 16:30 |
Osaka | Nakanoshima Center, Osaka Univ. | Subregion Retrieval of Natural Images by Using Tree Structures, and Application to Fractal Compression and Image Mining Takashi Fukumura, Mahito Sugiyama, Akihiro Yamamoto (Kyoto Univ) IBISML2010-112 |
In this paper, we propose a new method for speeding up retrieval of subregions in natural images by using tree structure... [more] | IBISML2010-112 pp.55-62 |
| ISEC, IT, WBS | 2011-03-04 09:00 |
Osaka | Osaka University | An improved PPM* Algorithm based on the Minimal Expected Codeword Length and Switching Escape Probability Estimation Keita Tomokuni, Hirosuke Yamamoto (Univ. of Tokyo) IT2010-104 ISEC2010-108 WBS2010-83 |
For the PPM data compression algorithm, several methods have been proposed to estimate the ESC probability, where ESC re... [more] | IT2010-104 ISEC2010-108 WBS2010-83 pp.235-242 |
[Return to Top Page]