Takuya Takagi
Takuya Takagi
Verified email at fujitsu.com
Title
Cited by
Cited by
Year
MR-RePair: Grammar compression based on maximal repeats
I Furuya, T Takagi, Y Nakashima, S Inenaga, H Bannai, T Kida
2019 Data Compression Conference (DCC), 508-517, 2019
142019
Linear-size CDAWG: New repetition-aware indexing and grammar compression
T Takagi, K Goto, Y Fujishige, S Inenaga, H Arimura
International Symposium on String Processing and Information Retrieval, 304-316, 2017
132017
Packed compact tries: A fast and efficient data structure for online string processing
T Takagi, S Inenaga, K Sadakane, H Arimura
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2017
132017
DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization
K Kanamori, T Takagi, K Kobayashi, H Arimura
Proceedings of the Twenty-Ninth International Joint Conference on Artificial …, 2020
112020
Enumeration of complete set of flock patterns in trajectories
X Geng, T Takagi, H Arimura, T Uno
Proceedings of the 5th ACM SIGSPATIAL International Workshop on GeoStreaming …, 2014
82014
Finding all maximal duration flock patterns in high-dimensional trajectories
H Arimura, T Takagi, X Geng, T Uno
Manuscript, DCS, IST, Hokkaido University, 2014
82014
Fully-online construction of suffix trees for multiple texts
T Takagi, S Inenaga, H Arimura
27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
42016
On Reverse Engineering the Lyndon Tree.
Y Nakashima, T Takagi, S Inenaga, H Bannai, M Takeda
Stringology, 108-117, 2017
32017
Fully-online construction of suffix trees and dawgs for multiple texts
T Takagi, S Inenaga, H Arimura
arXiv preprint arXiv:1507.07622, 2015
32015
Online algorithms for constructing linear-size suffix trie
D Hendrian, T Takagi, S Inenaga
arXiv preprint arXiv:1901.10045, 2019
22019
Truncated DAWGs and their application to minimal absent word problem
Y Fujishige, T Takagi, D Hendrian
International Symposium on String Processing and Information Retrieval, 139-152, 2018
22018
Applications of succinct dynamic compact tries to some string problems
T Takagi, T Uemura, S Inenaga, K Sadakane, H Arimura
2
Fully-online suffix tree and directed acyclic word graph construction for multiple texts
T Takagi, S Inenaga, H Arimura, D Breslauer, D Hendrian
Algorithmica 82 (5), 1346-1377, 2020
12020
Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification
H Iwashita, T Takagi, H Suzuki, K Goto, K Ohori, H Arimura
arXiv preprint arXiv:2004.08015, 2020
12020
On the size of the smallest alphabet for Lyndon trees
Y Nakashima, T Takagi, S Inenaga, H Bannai, M Takeda
Theoretical Computer Science 792, 131-143, 2019
12019
Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts
T Takagi, S Inenaga, H Arimura, D Breslauer, D Hendrian
arXiv preprint arXiv:1507.07622, 2015
12015
Predicting method, predicting apparatus, and computer-readable recording medium
H Iwashita, T Takagi, K Goto, K Ohori
US Patent App. 16/900,148, 2021
2021
Prediction method, prediction apparatus, and computer-readable recording medium
T Takagi, H Iwashita, K Goto, K Ohori
US Patent App. 16/904,305, 2021
2021
Publications: Hiroki Arimura
K Kanamori, T Takagi, K Kobayashi, Y Ike, K Uemura
Proc. the 29th International Joint Conference on Artificial Intelligence and …, 2021
2021
Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization
K Kanamori, T Takagi, K Kobayashi, Y Ike, K Uemura, H Arimura
arXiv preprint arXiv:2012.11782, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20