Yoshinaka Ryo

ヨシナカリョウ | Yoshinaka Ryo

Affiliation and department：
Homepage URL (2)： http://db.tohoku.ac.jp/whois/detail/7f97997ea43be649dfe3737bfedf5bcb.html , http://db.tohoku.ac.jp/whois/e_detail/7f97997ea43be649dfe3737bfedf5bcb.html

Research field (1)： Intelligent informatics

Research keywords (2)： Algorithm , Grammatical Inference

Research theme for competitive and other funds (13)：

2024 - 2028 Making treewidth and pathwidth practical
2020 - 2025 Program Verification Techniques for the AI Era
2019 - 2023 Efficient generation algorithms for geometric graph classes
2018 - 2023 Statistical Representation of Internal States of Depth Neural Networks and Exploration of New Learning Methods
2018 - 2023 一意標準形文法をもつ文脈自由言語族およびその学習に関する研究

Show all

Papers (91)：

Davaajav Jargalsaikhan, Diptarama Hendrian, Yohei Ueki, Ryo Yoshinaka, Ayumi Shinohara. Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm. Acta Informatica. 2024
Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka. Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes. Theoretical Computer Science. 2024. 114591-114591
Yoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara. Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages. Lecture Notes in Computer Science. 2024. 340-354
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka. Sorting balls and water: Equivalence and computational complexity. Theor. Comput. Sci. 2023. 978. 114158-114158
Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara. Efficient Parameterized Pattern Matching in Sublinear Space. String Processing and Information Retrieval. 2023. 271-283

ｍore...

MISC (22)：

Chubachi, K, Diptarama, H, Yoshinaka, R, Shinohara, A. Query Learning of Residual Symbolic Automata. Work in Progress Track, ICGI 2018. 2018
Enumerating Letter Graphs by Zero-suppressed Decision Diagrams. 2016. 116. 116. 33-40
宮近充裕, 吉仲亮, 山本章博. Approximate String Matching Based on Extending Levenshtein Automata for Tries (特集「離散問題とデータ科学の接点」および一般). 人工知能基本問題研究会. 2016. 99. 11-16
An Efficient Algorithm to Recalculate Graph Polishing for the Change of Threshold. 2016. 99. 69-74
Parameter Estimation of Stochastic Grammars with Probabilistic Logic Programs. 2016. 99. 81-86

ｍore...

Books (1)：

Lectures and oral presentations (1)：

General Perspective on Distributionally Learnable Classes
(The 14th Meeting on Mathematics of Language 2015)

Professional career (1)：

Work history (5)：

Association Membership(s) (1)：

情報処理学会

※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page