default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakuya Kida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j13]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
Practical Grammar Compression Based on Maximal Repeats. Algorithms 13(4): 103 (2020)- [j12]Takuya Kida, Tetsuji Kuboyama, Takeaki Uno, Akihiro Yamamoto:
Guest Editorial: Special issue on Discovery Science. Mach. Learn. 109(6): 1145-1146 (2020)
2010 – 2019
- 2019
- [j11]Isamu Furuya
, Takuya Kida:
Compaction of Church Numerals. Algorithms 12(8): 159 (2019) - [j10]Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno:
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". Rev. Socionetwork Strateg. 13(2): 99-100 (2019) - [c30]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
MR-RePair: Grammar Compression Based on Maximal Repeats. DCC 2019: 508-517 - 2018
- [j9]Iku Ohama, Takuya Kida, Hiroki Arimura:
Discovering Co-Cluster Structure from Relationships between Biased Objects. IEICE Trans. Inf. Syst. 101-D(12): 3108-3122 (2018) - [c29]Isamu Furuya, Takuya Kida:
Compaction of Church Numerals for Higher-Order Compression. DCC 2018: 408 - [i2]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
MR-RePair: Grammar Compression based on Maximal Repeats. CoRR abs/1811.04596 (2018) - 2017
- [c28]Iku Ohama, Takuya Kida, Hiroki Arimura:
Discovering Relevance-Dependent Bicluster Structure from Relational Data. IJCAI 2017: 2578-2584 - [c27]Iku Ohama, Issei Sato, Takuya Kida, Hiroki Arimura:
On the Model Shrinkage Effect of Gamma Process Edge Partition Models. NIPS 2017: 397-405 - [e1]Akihiro Yamamoto, Takuya Kida, Takeaki Uno, Tetsuji Kuboyama:
Discovery Science - 20th International Conference, DS 2017, Kyoto, Japan, October 15-17, 2017, Proceedings. Lecture Notes in Computer Science 10558, Springer 2017, ISBN 978-3-319-67785-9 [contents] - [i1]Isamu Furuya, Takuya Kida:
Compaction of Church Numerals for Higher-Order Compression. CoRR abs/1706.10061 (2017) - 2016
- [j8]Iku Ohama, Hiromi Iida, Takuya Kida, Hiroki Arimura:
The Relevance Dependent Infinite Relational Model for Discovering Co-Cluster Structure from Relationships with Structured Noise. IEICE Trans. Inf. Syst. 99-D(4): 1139-1152 (2016) - [c26]Takuya Masaki, Takuya Kida:
Online Grammar Transformation Based on Re-Pair Algorithm. DCC 2016: 349-358 - 2015
- [j7]Satoshi Yoshida, Takuya Kida:
An efficient Variable-to-Fixed length encoding using multiplexed parse trees. J. Discrete Algorithms 32: 75-86 (2015) - [c25]Iku Ohama, Takuya Kida, Hiroki Arimura:
Multi-Layered Framework for Modeling Relationships between Biased Objects. SDM 2015: 819-827 - 2014
- [c24]Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, Takuya Kida:
Adaptive Dictionary Sharing Method for Re-Pair Algorithm. DCC 2014: 425 - [c23]Satoshi Yoshida, Hirohito Sasakawa, Kei Sekine, Takuya Kida:
Direct Access to Variable-to-Fixed Length Codes with a Succinct Index. DCC 2014: 436 - 2013
- [j6]Satoshi Yoshida, Takuya Kida:
A Variable-length-to-fixed-length Coding Method Using a Re-Pair Algorithm. Inf. Media Technol. 8(4): 971-977 (2013) - [c22]Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, Takuya Kida:
Variable-to-Fixed-Length Encoding for Large Texts Using Re-Pair Algorithm with Shared Dictionaries. DCC 2013: 518 - [c21]Satoshi Yoshida, Takuya Kida:
Effective Variable-Length-to-Fixed-Length Coding via a Re-Pair Algorithm. DCC 2013: 532 - [c20]Iku Ohama, Hiromi Iida, Takuya Kida, Hiroki Arimura:
An Extension of the Infinite Relational Model Incorporating Interaction between Objects. PAKDD (2) 2013: 147-159 - 2012
- [j5]Satoshi Yoshida, Takashi Uemura, Takuya Kida, Tatsuya Asai, Seishi Okamoto:
Improving Parse Trees for Efficient Variable-to-Fixed Length Codes. Inf. Media Technol. 7(1): 129-140 (2012) - [j4]Satoshi Yoshida, Takashi Uemura, Takuya Kida, Tatsuya Asai, Seishi Okamoto:
Improving Parse Trees for Efficient Variable-to-Fixed Length Codes. J. Inf. Process. 20(1): 238-249 (2012) - [c19]Satoshi Yoshida, Takuya Kida:
Analysis of Multiplexed Parse Trees for Almost Instantaneous VF Codes. IIAI-AAI 2012: 36-41 - 2011
- [j3]Takashi Uemura, Daisuke Ikeda, Takuya Kida, Hiroki Arimura:
Unsupervised Spam Detection by Document Probability Estimation with Maximal Overlap Method. Inf. Media Technol. 6(1): 231-240 (2011) - [c18]Satoshi Yoshida, Takuya Kida:
On Performance of Compressed Pattern Matching on VF Codes. DCC 2011: 486 - [c17]Jumpei Fujikawa, Takuya Kida, Takashi Katoh:
Extracting refrained phrases from music signals using a frequent episode pattern mining algorithm. GrC 2011: 199-202 - 2010
- [c16]Satoshi Yoshida, Takuya Kida:
An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree. DCC 2010: 219-228 - [c15]Takashi Uemura, Satoshi Yoshida, Takuya Kida, Tatsuya Asai, Seishi Okamoto:
Training Parse Trees for Efficient VF Coding. SPIRE 2010: 179-184
2000 – 2009
- 2009
- [j2]Hiroshi Sakamoto, Shirou Maruyama, Takuya Kida, Shinichi Shimozono:
A Space-Saving Approximation Algorithm for Grammar-Based Compression. IEICE Trans. Inf. Syst. 92-D(2): 158-165 (2009) - [c14]Takuya Kida:
Suffix Tree Based VF-Coding for Compressed Pattern Matching. DCC 2009: 449 - [c13]Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura:
Efficient serial episode mining with minimal occurrences. ICUIMC 2009: 457-464 - 2008
- [c12]Takuya Kida, Tomoya Saito, Hiroki Arimura:
Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream. PAKDD Workshops 2008: 1-12 - 2005
- [c11]Takuya Kida:
Faster Pattern Matching Algorithm for Arc-Annotated Sequences. Federation over the Web 2005: 25-39 - 2004
- [c10]Hiroshi Sakamoto, Takuya Kida, Shinichi Shimozono:
A Space-Saving Linear-Time Algorithm for Grammar-Based Compression. SPIRE 2004: 218-229 - 2003
- [j1]Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Collage system: a unifying framework for compressed pattern matching. Theor. Comput. Sci. 298(1): 253-272 (2003) - 2002
- [c9]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
- [c8]Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Multiple Pattern Matching Algorithms on Collage System. CPM 2001: 193-206 - [c7]Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Faster Approximate String Matching over Compressed Text. Data Compression Conference 2001: 459-468 - 2000
- [c6]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 - [c5]Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Bit-Parallel Approach to Approximate String Matching in Compressed Texts. SPIRE 2000: 221-228
1990 – 1999
- 1999
- [c4]Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Shift-And Approach to Pattern Matching in LZW Compressed Text. CPM 1999: 1-13 - [c3]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 - [c2]Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
A Unifying Framework for Compressed Pattern Matching. SPIRE/CRIWG 1999: 89-96 - 1998
- [c1]Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa:
Multiple Pattern Matching in LZW Compressed Text. Data Compression Conference 1998: 103-112
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 01:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
