Takuya Kida

Orcid: 0000-0003-1666-3303

According to our database1, Takuya Kida authored at least 40 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Guest Editorial: Special issue on Discovery Science.
Mach. Learn., 2020

Practical Grammar Compression Based on Maximal Repeats.
Algorithms, 2020

2019
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data".
Rev. Socionetwork Strateg., 2019

Compaction of Church Numerals.
Algorithms, 2019

MR-RePair: Grammar Compression Based on Maximal Repeats.
Proceedings of the Data Compression Conference, 2019

2018
Discovering Co-Cluster Structure from Relationships between Biased Objects.
IEICE Trans. Inf. Syst., 2018

Compaction of Church Numerals for Higher-Order Compression.
Proceedings of the 2018 Data Compression Conference, 2018

2017
On the Model Shrinkage Effect of Gamma Process Edge Partition Models.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Discovering Relevance-Dependent Bicluster Structure from Relational Data.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
The Relevance Dependent Infinite Relational Model for Discovering Co-Cluster Structure from Relationships with Structured Noise.
IEICE Trans. Inf. Syst., 2016

Online Grammar Transformation Based on Re-Pair Algorithm.
Proceedings of the 2016 Data Compression Conference, 2016

2015
An efficient Variable-to-Fixed length encoding using multiplexed parse trees.
J. Discrete Algorithms, 2015

Multi-Layered Framework for Modeling Relationships between Biased Objects.
Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015

2014
Direct Access to Variable-to-Fixed Length Codes with a Succinct Index.
Proceedings of the Data Compression Conference, 2014

Adaptive Dictionary Sharing Method for Re-Pair Algorithm.
Proceedings of the Data Compression Conference, 2014

2013
An Extension of the Infinite Relational Model Incorporating Interaction between Objects.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2013

Effective Variable-Length-to-Fixed-Length Coding via a Re-Pair Algorithm.
Proceedings of the 2013 Data Compression Conference, 2013

Variable-to-Fixed-Length Encoding for Large Texts Using Re-Pair Algorithm with Shared Dictionaries.
Proceedings of the 2013 Data Compression Conference, 2013

2012
Improving Parse Trees for Efficient Variable-to-Fixed Length Codes.
J. Inf. Process., 2012

Analysis of Multiplexed Parse Trees for Almost Instantaneous VF Codes.
Proceedings of the IIAI International Conference on Advanced Applied Informatics, 2012

2011
Extracting refrained phrases from music signals using a frequent episode pattern mining algorithm.
Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

On Performance of Compressed Pattern Matching on VF Codes.
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

2010
Training Parse Trees for Efficient VF Coding.
Proceedings of the String Processing and Information Retrieval, 2010

An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree.
Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

2009
A Space-Saving Approximation Algorithm for Grammar-Based Compression.
IEICE Trans. Inf. Syst., 2009

Efficient serial episode mining with minimal occurrences.
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, 2009

Suffix Tree Based VF-Coding for Compressed Pattern Matching.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

2008
Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream.
Proceedings of the New Frontiers in Applied Data Mining, 2008

2005
Faster Pattern Matching Algorithm for Arc-Annotated Sequences.
Proceedings of the Federation over the Web, 2005

2004
A Space-Saving Linear-Time Algorithm for Grammar-Based Compression.
Proceedings of the String Processing and Information Retrieval, 2004

2003
Collage system: a unifying framework for compressed pattern matching.
Theor. Comput. Sci., 2003

2002
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts.
Proceedings of the String Processing and Information Retrieval, 2002

2001
Faster Approximate String Matching over Compressed Text.
Proceedings of the Data Compression Conference, 2001

Multiple Pattern Matching Algorithms on Collage System.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000
Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Speeding Up Pattern Matching by Text Compression.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
A Unifying Framework for Compressed Pattern Matching.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Discovering Poetic Allusion in Anthologies of Classical Japanese Poems.
Proceedings of the Discovery Science, 1999

Shift-And Approach to Pattern Matching in LZW Compressed Text.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998
Multiple Pattern Matching in LZW Compressed Text.
Proceedings of the Data Compression Conference, 1998


  Loading...