 | 2012 |
| 21 |  | Satoshi Yoshida,
Takashi Uemura,
Takuya Kida,
Tatsuya Asai,
Seishi Okamoto:
Improving Parse Trees for Efficient Variable-to-Fixed Length Codes.
JIP 20(1): 238-249 (2012) |
| 2011 |
| 20 |  | Satoshi Yoshida,
Takuya Kida:
On Performance of Compressed Pattern Matching on VF Codes.
DCC 2011: 486 |
| 19 |  | Jumpei Fujikawa,
Takuya Kida,
Takashi Katoh:
Extracting refrained phrases from music signals using a frequent episode pattern mining algorithm.
GrC 2011: 199-202 |
| 2010 |
| 18 |  | Satoshi Yoshida,
Takuya Kida:
An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree.
DCC 2010: 219-228 |
| 17 |  | Takashi Uemura,
Satoshi Yoshida,
Takuya Kida,
Tatsuya Asai,
Seishi Okamoto:
Training Parse Trees for Efficient VF Coding.
SPIRE 2010: 179-184 |
| 2009 |
| 16 |  | Takuya Kida:
Suffix Tree Based VF-Coding for Compressed Pattern Matching.
DCC 2009: 449 |
| 15 |  | Hideyuki Ohtani,
Takuya Kida,
Takeaki Uno,
Hiroki Arimura:
Efficient serial episode mining with minimal occurrences.
ICUIMC 2009: 457-464 |
| 14 |  | Hiroshi Sakamoto,
Shirou Maruyama,
Takuya Kida,
Shinichi Shimozono:
A Space-Saving Approximation Algorithm for Grammar-Based Compression.
IEICE Transactions 92-D(2): 158-165 (2009) |
| 2008 |
| 13 |  | Takuya Kida,
Tomoya Saito,
Hiroki Arimura:
Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream.
PAKDD Workshops 2008: 1-12 |
| 2005 |
| 12 |  | Takuya Kida:
Faster Pattern Matching Algorithm for Arc-Annotated Sequences.
Federation over the Web 2005: 25-39 |
| 2004 |
| 11 |  | Hiroshi Sakamoto,
Takuya Kida,
Shinichi Shimozono:
A Space-Saving Linear-Time Algorithm for Grammar-Based Compression.
SPIRE 2004: 218-229 |
| 2003 |
| 10 |  | Takuya Kida,
Tetsuya Matsumoto,
Yusuke Shibata,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
Collage system: a unifying framework for compressed pattern matching.
Theor. Comput. Sci. 1(298): 253-272 (2003) |
| 2002 |
| 9 |  | Masayuki Takeda,
Satoru Miyamoto,
Takuya Kida,
Ayumi Shinohara,
Shuichi Fukamachi,
Takeshi Shinohara,
Setsuo Arikawa:
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts.
SPIRE 2002: 170-186 |
| 2001 |
| 8 |  | Takuya Kida,
Tetsuya Matsumoto,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
Multiple Pattern Matching Algorithms on Collage System.
CPM 2001: 193-206 |
| 7 |  | Gonzalo Navarro,
Takuya Kida,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
Faster Approximate String Matching over Compressed Text.
Data Compression Conference 2001: 459-468 |
| 2000 |
| 6 |  | Yusuke Shibata,
Takuya Kida,
Shuichi Fukamachi,
Masayuki Takeda,
Ayumi Shinohara,
Takeshi Shinohara,
Setsuo Arikawa:
Speeding Up Pattern Matching by Text Compression.
CIAC 2000: 306-315 |
| 5 |  | Tetsuya Matsumoto,
Takuya Kida,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
SPIRE 2000: 221-228 |
| 1999 |
| 4 |  | Takuya Kida,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
Shift-And Approach to Pattern Matching in LZW Compressed Text.
CPM 1999: 1-13 |
| 3 |  | Kouichi Tamari,
Mayumi Yamasaki,
Takuya Kida,
Masayuki Takeda,
Tomoko Fukuda,
Ichiro Nanri:
Discovering Poetic Allusion in Anthologies of Classical Japanese Poems.
Discovery Science 1999: 128-138 |
| 2 |  | Takuya Kida,
Yusuke Shibata,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
A Unifying Framework for Compressed Pattern Matching.
SPIRE/CRIWG 1999: 89-96 |
| 1998 |
| 1 |  | Takuya Kida,
Masayuki Takeda,
Ayumi Shinohara,
Masamichi Miyazaki,
Setsuo Arikawa:
Multiple Pattern Matching in LZW Compressed Text.
Data Compression Conference 1998: 103-112 |