Search Results for author: Yasuaki Kobayashi

Found 4 papers, 4 papers with code

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph

1 code implementation4 Aug 2023 Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue

In this paper, we present the first study of the computational complexity of converting an automata-based text index structure, called the Compact Directed Acyclic Word Graph (CDAWG), of size $e$ for a text $T$ of length $n$ into other text indexing structures for the same text, suitable for highly repetitive texts: the run-length BWT of size $r$, the irreducible PLCP array of size $r$, and the quasi-irreducible LPF array of size $e$, as well as the lex-parse of size $O(r)$ and the LZ77-parse of size $z$, where $r, z \le e$.

Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study

1 code implementation10 Dec 2021 Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi

Finding diverse solutions in combinatorial problems recently has received considerable attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021).

Metric Learning for Ordered Labeled Trees with pq-grams

1 code implementation9 Mar 2020 Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi, Akihiro Yamamoto

In order to perform metric learning based on pq-grams, we propose a new differentiable parameterized distance, weighted pq-gram distance.

General Classification Metric Learning

Automatic Source Code Summarization with Extended Tree-LSTM

1 code implementation19 Jun 2019 Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto, Atsushi Miyamoto, Tadayuki Matsumura

Neural machine translation models are used to automatically generate a document from given source code since this can be regarded as a machine translation task.

Code Summarization Machine Translation +2

Cannot find the paper you are looking for? You can Submit a new open access paper.