Ayumi Shinohara

195 papers A* 2A 3B 55C 26Misc 12Journal 62Unranked 32
YearRankTypeTitle / Venue / Authors
2026 B conf
Efficient Solutions to Variants of Inversion Problems of Range Minimum Queries.
SOFSEM
Souta Kobayashi, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
2026 J jnl
Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete.
CoRR
Radu Cosmin Dumitru, Ryo Yoshinaka, Ayumi Shinohara
2025 J jnl
BusOut is NP-complete.
CoRR
Takehiro Ishibashi, Ryo Yoshinaka, Ayumi Shinohara
2025 J jnl
Misère Greedy Nim and Misère Bounded Greedy Nim.
CoRR
Nanako Omiya, Ryo Yoshinaka, Ayumi Shinohara
2025 B conf
Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time.
CPM
Yuto Iguchi, Ryo Yoshinaka, Ayumi Shinohara
2025 — conf
Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets.
SOFSEM (2)
Yutaro Numaya, Yoshito Kawasaki, Ryo Yoshinaka, Ayumi Shinohara
2025 J jnl
Solvable Tuple Patterns and Their Applications to Program Verification.
CoRR
Naoki Kobayashi, Ryosuke Sato, Ayumi Shinohara, Ryo Yoshinaka
2025 J jnl
StrNim: a variant of Nim played on strings.
CoRR
Shota Mizuno, Ryo Yoshinaka, Ayumi Shinohara
2025 — conf
Subsequence Matching and LCS with Segment Number Constraints.
CIAC (2)
Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
2024 B conf
Algorithms for Galois Words: Detection, Factorization, and Rotation.
CPM
Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
2024 J jnl
Algorithms for Galois Words: Detection, Factorization, and Rotation.
CoRR
Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
2024 A* conf
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching.
ICALP
Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
2024 B conf
Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages.
SOFSEM
Yoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2024 J jnl
Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm.
Acta Informatica
Davaajav Jargalsaikhan, Diptarama Hendrian, Yohei Ueki, Ryo Yoshinaka, Ayumi Shinohara
2024 J jnl
Subsequence Pattern Matching with Segment Number Constraint.
CoRR
Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
2023 J jnl
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching.
CoRR
Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
2023 C conf
Efficient Parameterized Pattern Matching in Sublinear Space.
SPIRE
Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2023 J jnl
Efficient Parameterized Pattern Matching in Sublinear Space.
CoRR
Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2023 — conf
Identification of Substitutable Context-Free Languages over Infinite Alphabets from Positive Data.
ICGI
Yutaro Numaya, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2023 B conf
Inferring Strings from Position Heaps in Linear Time.
WALCOM
Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2022 C conf
Computing the Parameterized Burrows-Wheeler Transform Online.
SPIRE
Daiki Hashimoto, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
2022 J jnl
Computing the Parameterized Burrows-Wheeler Transform Online.
CoRR
Daiki Hashimoto, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
2022 J jnl
Inferring strings from position heaps in linear time.
CoRR
Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2022 B conf
Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations.
CPM
Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2022 J jnl
Parallel algorithm for pattern matching problems under substring consistent equivalence relations.
CoRR
Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2022 J jnl
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches.
Theor. Comput. Sci.
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2021 — conf
Inside-Outside Algorithm for Macro Grammars.
ICGI
Ryuta Kambe, Naoki Kobayashi, Ryosuke Sato, Ayumi Shinohara, Ryo Yoshinaka
2021 — conf
Query Learning Algorithm for Symbolic Weighted Finite Automata.
ICGI
Kaito Suzuki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2020 — conf
AOBA: An Online Benchmark Tool for Algorithms in Stringology.
SOFSEM (Doctoral Student Research Forum)
Ryu Wakimoto, Satoshi Kobayashi, Yuki Igarashi, Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2020 — conf
An Extension of Linear-size Suffix Tries for Parameterized Strings.
SOFSEM (Doctoral Student Research Forum)
Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2020 C conf
Computing Covers Under Substring Consistent Equivalence Relations.
SPIRE
Natsumi Kikuchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2020 J jnl
Computing Covers under Substring Consistent Equivalence Relations.
CoRR
Natsumi Kikuchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2020 B conf
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures.
CPM
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2020 J jnl
DAWGs for parameterized matching: online construction and related indexing structures.
CoRR
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2020 B conf
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.
CPM
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
2020 J jnl
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.
CoRR
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
2020 J jnl
Efficient computation of longest single-arm-gapped palindromes in a string.
Theor. Comput. Sci.
Shintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara
2020 B conf
Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences.
SEA
Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2020 J jnl
Fast and linear-time string matching algorithms based on the distances of q-gram occurrences.
CoRR
Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2020 B conf
Grammar Compression with Probabilistic Context-Free Grammar.
DCC
Hiroaki Naganuma, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara, Naoki Kobayashi
2020 J jnl
Grammar compression with probabilistic context-free grammar.
CoRR
Hiroaki Naganuma, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara, Naoki Kobayashi
2020 B conf
In-Place Bijective Burrows-Wheeler Transforms.
CPM
Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara
2020 J jnl
In-Place Bijective Burrows-Wheeler Transforms.
CoRR
Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara
2020 J jnl
Linear-time online algorithm for inferring the shortest path graph from a walk label.
Theor. Comput. Sci.
Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2020 B conf
Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching.
SOFSEM
Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2019 Misc conf
An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm.
PSC
Satoshi Kobayashi, Diptarama, Ryo Yoshinaka, Ayumi Shinohara
2019 — ch.
Cyber-Enhanced Rescue Canine.
Disaster Robotics
Kazunori Ohno, Ryunosuke Hamada, Tatsuya Hoshi, Hiroyuki Nishinoma, Shumpei Yamaguchi, Solvi Arnold, Kimitoshi Yamazaki, Takefumi Kikusui, Satoko Matsubara, Miho Nagasawa, Takatomi Kubo, Eri Nakahara, Yuki Maruno, Kazushi Ikeda, Toshitaka Yamakawa, Takeshi Tokuyama, Ayumi Shinohara, Ryo Yoshinaka, Diptarama Hendrian, Kaizaburo Chubachi, Satoshi Kobayashi, Katsuhito Nakashima, Hiroaki Naganuma, Ryu Wakimoto, Shu Ishikawa, Tatsuki Miura, Satoshi Tadokoro
2019 — conf
Development of a Lightweight Cyber-enhanced Rescue Canine Suit with Heat Protection and Anti-slip Countermeasures.
SSRR
Hiroyuki Nishinoma, Beokhaimook Chayapol, Kazunori Ohno, Ayumi Shinohara, Satoshi Tadokoro
2019 J jnl
Efficient dynamic dictionary matching with DAWGs and AC-automata.
Theor. Comput. Sci.
Diptarama Hendrian, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
2019 J jnl
Linear-size Suffix Tries for Parameterized Strings.
CoRR
Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2019 J jnl
Permuted Pattern Matching Algorithms on Multi-Track Strings.
Algorithms
Diptarama Hendrian, Yohei Ueki, Kazuyuki Narisawa, Ryo Yoshinaka, Ayumi Shinohara
2019 — conf
Query Learning Algorithm for Residual Symbolic Finite Automata.
GandALF
Kaizaburo Chubachi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2018 B conf
Duel and Sweep Algorithm for Order-Preserving Pattern Matching.
SOFSEM
Davaajav Jargalsaikhan, Diptarama, Yohei Ueki, Ryo Yoshinaka, Ayumi Shinohara
2018 J jnl
Enumerating Cryptarithms Using Deterministic Finite Automata.
CoRR
Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Takashi Horiyama, Ayumi Shinohara
2018 C conf
Enumeration of Cryptarithms Using Deterministic Finite Automata.
CIAA
Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2018 C conf
Linear-Time Online Algorithm Inferring the Shortest Path from a Walk.
SPIRE
Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2018 J jnl
Linear-Time Online Algorithm Inferring the Shortest Path from a Walk.
CoRR
Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2018 B conf
New Variants of Pattern Matching with Constants and Variables.
SOFSEM
Yuki Igarashi, Diptarama, Ryo Yoshinaka, Ayumi Shinohara
2018 J jnl
Renewal of the Major Fields from New Generation Computing Vol. 36 (2018).
New Gener. Comput.
Masayuki Numao, Yutaka Matsuo, Ayumi Shinohara, Masaki Suwa
2017 B conf
An efficient query learning algorithm for zero-suppressed binary decision diagrams.
ALT
Hayato Mizumoto, Shota Todoroki, Diptarama, Ryo Yoshinaka, Ayumi Shinohara
2017 B conf
Computing Longest Single-arm-gapped Palindromes in a String.
SOFSEM
Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara
2017 J jnl
Duel and sweep algorithm for order-preserving pattern matching.
CoRR
Davaajav Jargalsaikhan, Diptarama, Ryo Yoshinaka, Ayumi Shinohara
2017 J jnl
Efficient Dynamic Dictionary Matching with DAWGs and AC-automata.
CoRR
Diptarama, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
2017 B conf
Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.
SOFSEM
Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara
2017 J jnl
New Variants of Pattern Matching with Constants and Variables.
CoRR
Yuki Igarashi, Diptarama, Ryo Yoshinaka, Ayumi Shinohara
2017 B conf
Position Heaps for Parameterized Strings.
CPM
Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara
2017 J jnl
Position Heaps for Parameterized Strings.
CoRR
Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara
2016 — conf
A Fast Order-Preserving Matching with q-neighborhood Filtration Using SIMD Instructions.
SOFSEM (Student Research Forum Papers / Posters)
Yohei Ueki, Kazuyuki Narisawa, Ayumi Shinohara
2016 C conf
AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching.
SPIRE
Diptarama, Ryo Yoshinaka, Ayumi Shinohara
2016 A conf
Compact bit encoding schemes for simply-typed lambda-terms.
ICFP
Kotaro Takeda, Naoki Kobayashi, Kazuya Yaguchi, Ayumi Shinohara
2016 J jnl
Computing longest single-arm-gapped palindromes in a string.
CoRR
Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara
2016 Misc conf
Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings.
PSC
Diptarama, Ryo Yoshinaka, Ayumi Shinohara
2016 B conf
Generalization of Efficient Implementation of Compression by Substring Enumeration.
DCC
Shumpei Sakuma, Kazuyuki Narisawa, Ayumi Shinohara
2016 — conf
KMP Based Pattern Matching Algorithms for Multi-Track Strings.
SOFSEM (Student Research Forum Papers / Posters)
Diptarama, Yohei Ueki, Kazuyuki Narisawa, Ayumi Shinohara
2016 J jnl
Longest Common Subsequence in at Least k Length Order-isomorphic Substrings.
CoRR
Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara
2016 — ch.
Pattern Matching on Compressed Text.
Encyclopedia of Algorithms
Masayuki Takeda, Ayumi Shinohara
2016 — conf
QBF Encoding of Generalized Tic-Tac-Toe.
QBF@SAT
Diptarama, Ryo Yoshinaka, Ayumi Shinohara
2016 — conf
Visualization and Analysis of Electrical Energy Consumption in Laboratories.
IIAI-AAI
Ichinari Sato, Diptarama, Ayumi Shinohara
2015 J jnl
Detecting regularities on grammar-compressed strings.
Inf. Comput.
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2015 — conf
Position Heaps for Permuted Pattern Matching on Multi-Track String.
SOFSEM (Student Research Forum Papers / Posters)
Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara
2014 — conf
A Simple Classification Method for Class Imbalanced Data using the Kernel Mean.
KDIR
Yusuke Sato, Kazuyuki Narisawa, Ayumi Shinohara
2014 J jnl
Average number of occurrences of repetitions in a necklace.
Discret. Appl. Math.
Kazuhiko Kusano, Ayumi Shinohara
2014 B conf
Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints.
SOFSEM
Tomoki Komatsu, Ryosuke Okuta, Kazuyuki Narisawa, Ayumi Shinohara
2014 B conf
Efficient Algorithm and Coding for Higher-Order Compression.
DCC
Kazuya Yaguchi, Naoki Kobayashi, Ayumi Shinohara
2014 — conf
Reducing Sample Complexity in Reinforcement Learning by Transferring Transition and Reward Probabilities.
ICAART (1)
Kouta Oguni, Kazuyuki Narisawa, Ayumi Shinohara
2013 B conf
Detecting Regularities on Grammar-Compressed Strings.
MFCS
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2013 J jnl
Detecting regularities on grammar-compressed strings
CoRR
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2013 Misc conf
On Morphisms Generating Run-Rich Strings.
PSC
Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara
2013 B conf
Permuted Pattern Matching on Multi-track Strings.
SOFSEM
Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga
2012 C conf
Computing Maximum Number of Runs in Strings.
SPIRE
Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara
2012 C conf
Functional programs as compressed data.
PEPM
Naoki Kobayashi, Kazutaka Matsuda, Ayumi Shinohara
2012 J jnl
Functional programs as compressed data.
High. Order Symb. Comput.
Naoki Kobayashi, Kazutaka Matsuda, Ayumi Shinohara, Kazuya Yaguchi
2012 — conf
Prediction for Control Delay on Reinforcement Learning.
ICAART (1)
Junya Saito, Kazuyuki Narisawa, Ayumi Shinohara
2010 J jnl
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs.
Chic. J. Theor. Comput. Sci.
Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
2010 Misc conf
Average Number of Runs and Squares in Necklace.
PSC
Kazuhiko Kusano, Ayumi Shinohara
2010 Misc conf
Inferring Strings from Runs.
PSC
Wataru Matsubara, Akira Ishino, Ayumi Shinohara
2010 A conf
Multi-target adaptive A.
AAMAS
Kengo Matsuta, Hayato Kobayashi, Ayumi Shinohara
2010 Misc conf
The Number of Runs in a Ternary Word.
PSC
Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson
2009 C conf
A Series of Run-Rich Strings.
LATA
Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara
2009 J jnl
Average Value of Sum of Exponents of Runs in a String.
Int. J. Found. Comput. Sci.
Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
2009 Misc conf
Bit-parallel Algorithms for Computing all the Runs in a String.
PSC
Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
2009 A* conf
Complexity of Teaching by a Restricted Number of Examples.
COLT
Hayato Kobayashi, Ayumi Shinohara
2009 J jnl
Development of an Interactive Augmented Environment and Its Application to Autonomous Learning for Quadruped Robots.
IEICE Trans. Inf. Syst.
Hayato Kobayashi, Tsugutoyo Osaki, Tetsuro Okuyama, Joshua Gramm, Akira Ishino, Ayumi Shinohara
2009 J jnl
Efficient algorithms to compute compressed longest common substrings and compressed palindromes.
Theor. Comput. Sci.
Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto
2009 — conf
Improvement of the performance using received message on learning of communication codes.
AAMAS (2)
Tatsuya Kasai, Hayato Kobayashi, Ayumi Shinohara
2009 J jnl
Linear-Time Text Compression by Longest-First Substitution.
Algorithms
Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara
2009 — conf
Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program.
CATS
Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
2008 — conf
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program.
Structure-Based Compression of Complex Massive Data
Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
2008 Misc conf
Average Value of Sum of Exponents of Runs in Strings.
PSC
Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
2008 B conf
Computing Longest Common Substring and All Palindromes from Compressed Strings.
SOFSEM
Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto
2008 C conf
Development of an Augmented Environment and Autonomous Learning for Quadruped Robots.
RoboCup
Hayato Kobayashi, Tsugutoyo Osaki, Tetsuro Okuyama, Akira Ishino, Ayumi Shinohara
2008 J jnl
New Lower Bounds for the Maximum Number of Runs in a String
CoRR
Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Hideo Bannai, Ayumi Shinohara
2008 Misc conf
New Lower Bounds for the Maximum Number of Runs in a String.
PSC
Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara
2007 B conf
Reducing Trials by Thinning-Out in Skill Discovery.
Discovery Science
Hayato Kobayashi, Kohei Hatano, Akira Ishino, Ayumi Shinohara
2006 C conf
A Framework for Advanced Robot Programming in the RoboCup Domain - Using Plug-in System and Scripting Language.
IAS
Hayato Kobayashi, Akira Ishino, Ayumi Shinohara
2006 C conf
Autonomous Learning of Ball Trapping in the Four-Legged Robot League.
RoboCup
Hayato Kobayashi, Tsugutoyo Osaki, Eric Williams, Akira Ishino, Ayumi Shinohara
2006 C conf
Ball tracking with velocity based on Monte-Carlo localization.
IAS
Jun Inoue, Akira Ishino, Ayumi Shinohara
2005 J jnl
A fully compressed pattern matching algorithm for simple collage systems.
Int. J. Found. Comput. Sci.
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2005 B conf
Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.
SOFSEM
Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara
2005 B conf
Fully Incremental LCS Computation.
FCT
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2005 — conf
New Bit-Parallel Indel-Distance Algorithm.
WEA
Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara
2005 J jnl
On-line construction of compact directed acyclic word graphs.
Discret. Appl. Math.
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
2005 J jnl
The size of subsequence automaton.
Theor. Comput. Sci.
Zdenek Tronícek, Ayumi Shinohara
2004 Misc conf
A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems.
PSC
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2004 C conf
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars.
Developments in Language Theory
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2004 J jnl
An O(N
IEEE ACM Trans. Comput. Biol. Bioinform.
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
2004 J jnl
Compact directed acyclic word graphs for a sliding window.
J. Discrete Algorithms
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2004 J jnl
Efficiently Finding Regulatory Elements Using Correlation with Gene Expression.
J. Bioinform. Comput. Biol.
Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano
2004 B conf
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.
Discovery Science
Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
2004 C conf
Finding Optimal Pairs of Patterns.
WABI
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
2004 — conf
On Bit-Parallel Processing of Multi-byte Text.
AIRS
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Masayuki Takeda
2004 B conf
String Pattern Discovery.
ALT
Ayumi Shinohara
2004 J jnl
Ternary directed acyclic word graphs.
Theor. Comput. Sci.
Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
2003 J jnl
A Note on Randomized Algorithm for String Matching with Mismatches.
Nord. J. Comput.
Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa
2003 J jnl
A practical algorithm to find the best subsequence patterns.
Theor. Comput. Sci.
Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2003 J jnl
Collage system: a unifying framework for compressed pattern matching.
Theor. Comput. Sci.
Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
2003 B conf
Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.
Discovery Science
Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa
2003 B conf
Inferring Strings from Graphs and Arrays.
MFCS
Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2003 C conf
Linear-Time Off-Line Text Compression by Longest-First Substitution.
SPIRE
Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara
2003 B conf
On the Length of the Minimum Solution of Word Equations in One Variable.
MFCS
Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda
2003 C conf
Ternary Directed Acyclic Word Graphs.
CIAA
Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
2003 C conf
The Size of Subsequence Automaton.
SPIRE
Zdenek Tronícek, Ayumi Shinohara
2003 J jnl
Uniform characterizations of polynomial-query learnabilities.
Theor. Comput. Sci.
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda
2002 Misc conf
A Note on Randomized Algorithm for String Matching with Mismatches.
PSC
Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa
2002 C conf
Compact Directed Acyclic Word Graphs for a Sliding Window.
SPIRE
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2002 B conf
Discovering Best Variable-Length-Don't-Care Patterns.
Discovery Science
Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2002 — conf
Finding Best Patterns Practically.
Progress in Discovery Science
Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga
2002 C conf
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts.
SPIRE
Masayuki Takeda, Satoru Miyamoto, Takuya Kida, Ayumi Shinohara, Shuichi Fukamachi, Takeshi Shinohara, Setsuo Arikawa
2002 — ed.
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Progress in Discovery Science
Setsuo Arikawa, Ayumi Shinohara
2002 B conf
Space-Economical Construction of Index Structures for All Suffixes of a String.
MFCS
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa
2002 B conf
The Minimum DAWG for All Suffixes of a String and Its Applications.
CPM
Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa
2001 B conf
A Practical Algorithm to Find the Best Episode Patterns.
Discovery Science
Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2001 B conf
Compressed Pattern Matching for SEQUITUR.
Data Compression Conference
Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2001 Misc conf
Construction of the CDAWG for a Trie.
PSC
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2001 B conf
Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems.
Discovery Science
Koichiro Yamamoto, Masayuki Takeda, Ayumi Shinohara, Tomoko Fukuda, Ichiro Nanri
2001 B ed.
Discovery Science, 4th International Conference, DS 2001, Washington, DC, USA, November 25-28, 2001, Proceedings
Discovery Science
Klaus P. Jantke, Ayumi Shinohara
2001 B conf
Faster Approximate String Matching over Compressed Text.
Data Compression Conference
Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
2001 B conf
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.
ISAAC
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara
2001 B conf
Multiple Pattern Matching Algorithms on Collage System.
CPM
Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
2001 C conf
Musical Sequence Comparison for Melodic and Rhythmic Similarities.
SPIRE
T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo
2001 B conf
On-Line Construction of Compact Directed Acyclic Word Graphs.
CPM
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
2001 C conf
On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.
SPIRE
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2000 B conf
A Boyer-Moore Type Algorithm for Compressed Pattern Matching.
CPM
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
2000 B conf
A Practical Algorithm to Find the Best Subsequence Patterns.
Discovery Science
Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2000 C conf
Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
SPIRE
Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
2000 C conf
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs.
SPIRE
Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2000 C conf
Online Construction of Subsequence Automata for Multiple Texts.
SPIRE
Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2000 J jnl
Polynomial-time Learning of Elementary Formal Systems.
New Gener. Comput.
Satoru Miyano, Ayumi Shinohara, Takeshi Shinohara
2000 C conf
Speeding Up Pattern Matching by Text Compression.
CIAC
Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa
1999 — conf
A Unifying Framework for Compressed Pattern Matching.
SPIRE/CRIWG
Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
1999 B conf
Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers.
Discovery Science
Toru Takae, Minoru Chikamune, Hiroki Arimura, Ayumi Shinohara, Hitoshi Inoue, Shun-ichi Takeya, Keiko Uezono, Terukazu Kawasaki
1999 B conf
Pattern Matching in Text Compressed by Using Antidictionaries.
CPM
Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
1999 B conf
Shift-And Approach to Pattern Matching in LZW Compressed Text.
CPM
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
1998 B conf
Multiple Pattern Matching in LZW Compressed Text.
Data Compression Conference
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa
1998 J jnl
On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram.
Inf. Process. Lett.
Shinichi Shimozono, Kouichi Hirata, Ayumi Shinohara
1998 B conf
Uniform Characterizations of Polynomial-Query Learnabilities.
Discovery Science
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda
1997 J jnl
An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions.
Nord. J. Comput.
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
1997 B conf
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs.
CPM
Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda
1997 — conf
Learning Pattern Languages Using Queries.
EuroCOLT
Satoshi Matsumoto, Ayumi Shinohara
1996 — conf
On the Hardness of Approximating the Minimum Consistent OBDD Problem.
SWAT
Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara
1995 A conf
BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences.
ISMB
Takayoshi Shoudai, Michael Lappe, Satoru Miyano, Ayumi Shinohara, Takeo Okazaki, Setsuo Arikawa, Tomoyuki Uchida, Shinichi Shimozono, Takeshi Shinohara, Satoru Kuhara
1995 J jnl
Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions.
Theor. Comput. Sci.
Ayumi Shinohara
1995 — conf
Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems.
Machine Intelligence 15
Setsuo Arikawa, Masako Sato, Ayumi Shinohara, Takeshi Shinohara
1995 J jnl
Pattern-Matching for Strings with Short Descriptions
Electron. Colloquium Comput. Complex.
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
1995 B conf
Pattern-Matching for Strings with Short Descriptions.
CPM
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
1994 — conf
Complexity of Computing Generalized VC-Dimensions.
ECML
Ayumi Shinohara
1994 — conf
Machine Learning and Discovery for Bloinformatics: Introduction.
HICSS (5)
Satoru Miyano, Ayumi Shinohara
1994 — conf
Refutably Probably Approximately Correct Learning.
AII/ALT
Satoshi Matsumoto, Ayumi Shinohara
1993 J jnl
A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns.
New Gener. Comput.
Setsuo Arikawa, Satoru Miyano, Ayumi Shinohara, Satoru Kuhara, Yasuhito Mukouchi, Takeshi Shinohara
1993 B conf
Complexity of Computing Vapnik-Chervonenkis Dimension.
ALT
Ayumi Shinohara
1992 — conf
A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns.
FGCS
Setsuo Arikawa, Satoru Kuhara, Satoru Miyano, Yasuhito Mukouchi, Ayumi Shinohara, Takeshi Shinohara
1991 — conf
More About Learning Elementary Formal Systems.
Nonmonotonic and Inductive Logic
Setsuo Arikawa, Takeshi Shinohara, Satoru Miyano, Ayumi Shinohara
1991 J jnl
Teachability in Computational Learning.
New Gener. Comput.
Ayumi Shinohara
1991 B conf
Which classes of elementary formal systems are polynomial-time learnable.
ALT
Satoru Miyano, Ayumi Shinohara, Takeshi Shinohara
1990 B conf
Teachability in Computational Learning.
ALT
Ayumi Shinohara, Satoru Miyano