| 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, ISEC, RCC, WBS | 2022-03-11 15:35 |
Online | Online | The explicit formula for the distributions of nonoverlapping words Hayato Takahashi (Random Data Lab.)  IT2021-123 ISEC2021-88 WBS2021-91 RCC2021-98 |
Generating functions of the distributions of number of occurences of words and approximation of these distributions ar... [more] |
IT2021-123 ISEC2021-88 WBS2021-91 RCC2021-98 pp.234-236 |
| COMP, IPSJ-AL | 2015-06-13 14:20 |
Hokkaido | On an Extension of Ukkonen's Online Suffix tree construction algorithm to Multi-Stream texts Takuya Takagi, Hiroki Arimura (Hokkaido Univ.) COMP2015-13 |
In this paper, we consider online construction of a text index for a set $S$ of $K$ strings in the dynamic setting that ... [more] |
COMP2015-13 pp.125-132 |
|
| COMP | 2012-09-03 09:30 |
Tokyo | Hosei University | Permuted Pattern Matching and Indexing Structure for Multi-Track Strings Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.), Hideo Bannai, Shunsuke Inenaga (Kyushu Univ.) COMP2012-26 |
We propose a new variant of pattern matching on a multi-set of strings, or multi-tracks, called permuted-matching, tha... [more] |
COMP2012-26 pp.1-8 |
| IBISML | 2011-11-10 15:45 |
Nara | Nara Womens Univ. | A Linear Time Subpath Kernel for Trees Daisuke Kimura, Hisashi Kashima (Univ. of Tokyo) IBISML2011-85 |
Kernel method is one of the promising approaches to learning with tree-structured data, and various efficient tree ker... [more] |
IBISML2011-85 pp.291-296 |
| 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 |
| IT | 2010-07-22 10:15 |
Tokyo | Kogakuin University | Data compression based on the Optimal Context Determined by the Minimal Expected Codeword Length in a Suffix Tree Keita Tomokuni, Hirosuke Yamamoto (Univ. of Tokyo) IT2010-12 |
In this paper, we consider a data compression method, which encodes each byte of data by using a suffix tree. In the s... [more] |
IT2010-12 pp.7-12 |
| COMP | 2009-06-29 10:00 |
Hokkaido | Hokkaido University | Compressed Pattern Matching on VF Codes Takuya Kida (Hokkaido Univ.) COMP2009-18 |
We discuss the problem of pattern matching on a VF coded text. We introduce a KMP-type pattern matching algorithm that r... [more] | COMP2009-18 pp.1-8 |
| WBS, IT, ISEC | 2009-03-10 10:15 |
Hokkaido | Hakodate Mirai Univ. | Adaptive Antidictionary Data Compression Using a Set of Restricted Length of Minimal Forbidden Words Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (Univ. of Electro-Commu.) IT2008-99 ISEC2008-157 WBS2008-112 |
An antidictionary is the set of all minimal strings, called Minimal Forbidden Words (MFWs), which never appear in an inp... [more] | IT2008-99 ISEC2008-157 WBS2008-112 pp.363-370 |
| DE | 2008-09-21 17:00 |
Fukushima | [Poster Presentation]
Efficient Spam Post Detection by Compression-based Measure Using Suffix Trees Takashi Uemura (Hokaido Univ.), Daisuke Ikeda (Kyushu Univ.), Hiroki Arimura (Hokaido Univ.) DE2008-37 |
In this paper, we propose a content-based spam detection algorithm for blog spams and bulletin board spams. For a give... [more] |
DE2008-37 pp.15-16 |
|
| CAS, NLP | 2007-10-18 10:30 |
Tokyo | Musashi Institute of Technology | Branch Prediction Based on Antidictionary Tree Mikihiko Nishiara (Shinshu Univ.), Hiroyoshi Morita (UEC), Takahiro Ota (PIT-Nagano) CAS2007-38 NLP2007-66 |
It is necessary to predict by high accuracy the results of the branch commands so as not to obstruct the speed-up of mic... [more] | CAS2007-38 NLP2007-66 pp.21-24 |
| COMP | 2007-04-26 16:25 |
Kyoto | Katsura Campus, Kyoto University | Suffix Array Based Computation of Substring Equivalence Classes Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2007-9 |
This paper considers enumerating substring equivalence classes introduced by Blumer et al. They used the equivalence cl... [more] |
COMP2007-9 pp.63-70 |
| COMP | 2007-04-26 17:00 |
Kyoto | Katsura Campus, Kyoto University | On an Efficient Off-Line Construction of Property Suffix Trees Takashi Uemura, Takuya Kida, Hiroki Arimura (Hokkaido Univ.) COMP2007-10 |
In some intelligent application of text retrieval, it is required to do a search just through particular parts of target... [more] | COMP2007-10 pp.71-78 |
| IT | 2006-07-27 15:00 |
Chiba | Univ. of Tokyo | Data Compression Using Antidictionary for Finite-Alphabet Sources Takahiro Ota (Pit-Nagano), Hiroyoshi Morita (UEC) |
An antidictionary is a set of words of minimal length that never appear in this string. And it is known that the antid... [more] | IT2006-31 pp.37-42 |
| WBS, IT, ISEC | 2006-03-16 09:20 |
Aichi | Nagoya Univ. | Data Compression Using Source Model Based on Antidictionary Tree Takahiro Ota (Pit-Nagano), Hiroyoshi Morita (UEC) |
Data compression method using source model based on the automaton used antidictionary coding is proposed. However, the a... [more] | IT2005-87 ISEC2005-144 WBS2005-101 pp.135-140 |
| IT | 2005-07-22 10:50 |
Osaka | Osaka Prefecture Univ. | Construction Antidictionary of a Binary String Using Suffix Tree Takahiro Ota (PIT Nagano), Hiroyoshi Morita (UEC) |
An antidictionary is a set of shortest words that never appear in a binary string. To construct the antidictionary for a... [more] | IT2005-43 pp.9-14 |
[Return to Top Page]