KIDA Takuya

J-GLOBAL         Last updated: Jun 24, 2014 at 12:40
 
Avatar
Name
KIDA Takuya
URL
http://www-ikn.ist.hokudai.ac.jp/~kida/
Affiliation
Hokkaido University
Section
Graduate School of Information Science and Technology, Division of Computer Science, Knowledge Software Science
Job title
Associate Professor
Degree
Ph.D.(Kyushu University)
Research funding number
70343316

Research Areas

 
 

Academic & Professional Experience

 
Apr 2004
 - 
Today
Associate Professor, Hokkaido University
 
Oct 2001
 - 
Mar 2004
Lecturer, R&D section of Kyusyu University Library
 
2000
 - 
2001
 Postdoctoral Fellowships of Japan Society for the Promotion of Science,Research Fellow of the Japan Society for the Promotion of Science
 
2001
 - 
2004
 Lecturer,Kyushu University Library, R&D section
 

Education

 
 
 - 
1999
Kyushu University
 
 
 - 
2001
Kyushu University
 
 
 - 
Mar 1997
Physics, Faculty of Science, Kyusyu University
 

Awards & Honors

 
2001
Special Issue on IPSJ 40th Anniversary Award Papers, IPSJ.
 

Published Papers

 
Satoshi Yoshida,Hirohito Sasakawa,Kei Sekine,Takuya Kida
Data Compression Conference, DCC 2014, Snowbird, UT, USA, 26-28 March, 2014   436   2014   [Refereed]
Kei Sekine,Hirohito Sasakawa,Satoshi Yoshida,Takuya Kida
Data Compression Conference, DCC 2014, Snowbird, UT, USA, 26-28 March, 2014   425   2014   [Refereed]
A Variable-length-to-fixed-length Coding Method Using a Re-Pair Algorithm
Satoshi Yoshida and Takuya Kida
IPSJ Transactions on Databases   6(4) 17-23   Sep 2013   [Refereed]
Iku Ohama,Hiromi Iida,Takuya Kida,Hiroki Arimura
Advances in Knowledge Discovery and Data Mining, 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part II   147-159   2013   [Refereed]
Satoshi Yoshida,Takuya Kida
2013 Data Compression Conference, DCC 2013, Snowbird, UT, USA, March 20-22, 2013   532   2013   [Refereed]
Kei Sekine,Hirohito Sasakawa,Satoshi Yoshida,Takuya Kida
2013 Data Compression Conference, DCC 2013, Snowbird, UT, USA, March 20-22, 2013   518   2013   [Refereed]
KIDA Takuya
The IEICE transactions on information and systems (Japanese edetion)   93(6) 733-741   Jun 2010
UEMURA Takashi, KIDA Takuya, ARIMURA Hiroki
The IEICE transactions on information and systems (Japanese edetion)   91(3) 595-607   Mar 2008
Uemura Takashi, Kida Takuya, Arimura Hiroki
5(0) 5-8   Aug 2006

Misc

 
IPSJ SIG Notes   2014(8) 1-5   Jun 2014
In this paper, we propose a simple method solving the substring extraction problem for variable-to-fixed length codes (VF codes) by adding an auxiliary succinct index structure. The method solves the problem in O(N/n + l) time in the average case,...
113(493) 247-252   Mar 2014
Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, Takuya Kida
IPSJ SIG Notes   2012(7) 1-6   Dec 2012
The Re-Pair algorithm proposed by Larsson and Moffat in 1999 is a simple grammar-based compression method that achieves an extremely high compression ratio. However, Re-Pair is an offine and very space consuming algorithm. Thus, to apply it to a v...
OHAMA Iku, IIDA Hiromi, KIDA Takuya, ARIMURA Hiroki
111(480) 1-8   Mar 2012
We propose a new generative model which analyses asymmetric and individually different relational data. In our proposed model, each object has a parameter which adjusts chance of encounter with another objects. Then, based on the idea of subset cl...
Yoshida Satoshi, Kida Takuya
10(1) 149-150   Sep 2011
吉田諭史, 喜田拓也
情報科学技術フォーラム   FIT 2011 149-150   Aug 2011
Satoshi Yoshida, Takuya Kida
IPSJ SIG Notes   2011(14) 1-6   Jul 2011
In this paper, we discuss a method to improve the performance of VF codes by training the dictionary data structures. A VF code, we discuss here, is a source coding scheme that parses an input text into variable-length blocks with a dictionary tre...
OHAMA Iku, KIDA Takuya, ARIMURA Hiroki, ABE Toshihisa
IEICE technical report   110(476) 9-16   Mar 2011
We discuss the geographical clustering problem on human activity logs. In this paper, we formulate the problem as a segmentation problem for 2-dimensional sequence data, and propose two clustering methods, named LS-linHMM and X-linHMM. LS-linHMM i...
Satoshi Yoshida, Takuya Kida
IPSJ SIG Notes   2010(10) 1-8   Jul 2010
In this paper, we discuss about a method to preserve both search efficiency and compression ratio by combining VF coding with arithmetic coding. A VF code, we discuss here, is a source coding scheme that parses an input text into variable-length b...
Uemura Takashi, Kida Takuya
Proceedings of the IEICE General Conference   2010(1)    Mar 2010
YOSHIDA SATOSHI, KIDA TAKUYA
148(0)    Jul 2009
KIDA Takuya
IEICE technical report. Theoretical foundations of Computing   109(108) 1-8   Jun 2009
We discuss the problem of pattern matching on a VF coded text. We derive a KMP-type pattern matching algorithm from the collage system, which is a general framework to capture the essence of compressed pattern matching. The algorithm runs on a VF ...
NAKANO Tomoharu, KIDA Takuya
Technical report of IEICE. PRMU   108(363) 25-30   Dec 2008
We can touch a numerous number of images on the Internet in this days. Almost all images are stored in compressed form. The JPEG format is one of the most popular image formats. For a JPEG image, we usually need to decode it into a bitmap image in...
Takashi Uemura, Takuya Kida, Hiroki Arimura
1(1) 49-60   Jun 2008
Web browsers play an important role in information-gathering on the Internet. However, searching and browsing documents are still time-consuming jobs for many users. In this paper we present an algorithm for keyword extraction at the current Web p...
Uemura Takashi, KIDA Takuya, ARIMURA Hiroki
70(5) "5-207"-"5-208"   Mar 2008
UEMURA TAKASHI, KIDA TAKUYA, ARIMURA HIROKI
情報処理学会シンポジウムシリーズ(CD−ROM)   2007(3) 7B-1   Nov 2007
上村卓史, 喜田拓也, 有村博紀
情報科学技術フォーラム   FIT 2007 45-46   Aug 2007
Saito Tomoya, Kida Takuya, Arimura Hiroki
6(2) 43-44   Aug 2007
Uemura Takashi, Kida Takuya, Arimura Hiroki
6(2) 45-46   Aug 2007
UEMURA Takashi, KIDA Takuya, ARIMURA Hiroki
IEICE technical report. Theoretical foundations of Computing   107(24) 71-78   Apr 2007
In some intelligent application of text retrieval, it is required to do a search just through particular parts of target text data with consideration for some properties that the text have. Namely, the texts are followed by additional information,...
上村卓史, 喜田拓也, 有村博紀
情報科学技術フォーラム   FIT 2006 5-8   Aug 2006
Efficient Algorithm of Constructing Suffix Tree with Word Count Limitation
5 5-8   2006
STVF Code: An Efficient VF Coding using Frequency-base-pruned Suffix Tree
DBSJ Journal   8(1) 125-130   2009
An Efficient Compressed Pattern Matching Algorithm on Codes Represented by Parse Tree and Shared String
Vol.J93-D(No.6) 733-741   2010
喜田拓也
情報科学技術フォーラム   FIT 2005 25-28   Aug 2005
KIDA Takuya, MINAMI Toshiro
IPSJ SIG Notes   2005(68) 461-467   Jul 2005
Recently many libraries provide their patrons with OPAC (Online Public Access Catalog) system for retrieving their materials. However, in libraries with a long history for example, it often happens that a patron can not find very old materials by ...
ARIMURA Hiroki, KIDA Takuya
IPSJ Magazine   46(1) 4-11   Jan 2005
MINAMI TOSHIRO, IKEDA DAISUKE, KIDA TAKUYA
情報処理学会研究報告   2004(119(FI−77)) 7-22   Nov 2004
KIDA Takuya, SAKAMOTO Hiroshi, SHIMOZONO Shinichi
IEICE technical report. Theoretical foundations of Computing   104(317) 1-7   Sep 2004
A space-efficient linear-time approximation algorithm for the grammar-based compression problem, which requests for a given string to find a smallest context-free grammar deriving the string, is presented. The algorithm consumes only O(g_* log g_*...
KIDA TAKUYA, ARIMURA HIROKI
人工知能学会人工知能基本問題研究会資料   56th 73-78   Jul 2004
KIDA Takuya
IEICE technical report. Theoretical foundations of Computing   103(622) 61-68   Jan 2004
A variable length don't care (VLDC) pattern is a string pattern including gaps that can match any strings. Let P be a VLDC pattern and P be a set of strings that match to P. Given P and a string T, the problem we address is to answer whether T inc...
喜田拓也
情報科学技術フォーラム   FIT 2003 137-138   Aug 2003
Kida Takuya, Miyamoto Satoru, Takeda Masayuki
2002(2) 55-56   Sep 2002
Kida Takuya, Shibata Yusuke, Takeda Masayuki, Shinohara Ayumi, Arikawa Setsuo
59(1) "1-177"-"1-178"   Sep 1999
Shibata Yusuke, Kida Takuya, Takeda Masayuki, Shinohara Ayumi, Arikawa Setsuo
59(1) "1-175"-"1-176"   Sep 1999
KIDA TAKUYA, TAKEDA MASAYUKI, SHINOHARA AYUMI
情報処理学会全国大会講演論文集   57th(1) 1.143-1.144   Oct 1998
KIDA TAKUYA, TAKEDA MASAYUKI, MIYAZAKI MASAMICHI, SHINOHARA AYUMU
電気関係学会九州支部連合大会講演論文集   50th 275   Oct 1997

Research Grants & Projects

 
Study on VF codes for Fast and Sophisticated Pattern Matching with High Compression Ratios
Grant-in-Aid for Scientific Research
Project Year: 2011 - 2013
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(B))
Project Year: 2008 - 2011    Investigator(s): Shin-ichi MINATO
(抄録なし)
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(A))
Project Year: 2008 - 2011    Investigator(s): Hiroki ARIMURA
(抄録なし)
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(若手研究(B))
Project Year: 2008 - 2010    Investigator(s): Takuya KIDA
I have studied high speed and advanced pattern matching over continuous data streams and also about compression technique for realizing that. For the former, I have proposed a pattern matching algorithm, named BPS, which is based on bit-parallel t...
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(B))
Project Year: 2005 - 2007    Investigator(s): Shin-Ichi MINATO
Binary Decision Diagrams (BDDs) are the efficient data structure for representing Boolean functions on the main memory. The techniques of BDD manipulation have been developed in the area of VLSI logic design since 1990's. Recently, we found that t...