default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkira Ishino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[c15]Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Inferring Strings from Runs. Stringology 2010: 150-160
2000 – 2009
- 2009
- [j4]Hayato Kobayashi, Tsugutoyo Osaki, Tetsuro Okuyama, Joshua Gramm, Akira Ishino, Ayumi Shinohara
:
Development of an Interactive Augmented Environment and Its Application to Autonomous Learning for Quadruped Robots. IEICE Trans. Inf. Syst. 92-D(9): 1752-1761 (2009) - [j3]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Average Value of Sum of Exponents of Runs in a String. Int. J. Found. Comput. Sci. 20(6): 1135-1146 (2009) - [j2]Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto:
Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci. 410(8-10): 900-913 (2009) - [c14]Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Bit-parallel Algorithms for Computing all the Runs in a String. Stringology 2009: 203-213 - 2008
- [c13]Hayato Kobayashi, Tsugutoyo Osaki, Tetsuro Okuyama, Akira Ishino, Ayumi Shinohara:
Development of an Augmented Environment and Autonomous Learning for Quadruped Robots. RoboCup 2008: 109-120 - [c12]Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto:
Computing Longest Common Substring and All Palindromes from Compressed Strings. SOFSEM 2008: 364-375 - [c11]Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara:
New Lower Bounds for the Maximum Number of Runs in a String. Stringology 2008: 140-145 - [c10]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Average Value of Sum of Exponents of Runs in Strings. Stringology 2008: 185-192 - [i1]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Hideo Bannai, Ayumi Shinohara:
New Lower Bounds for the Maximum Number of Runs in a String. CoRR abs/0804.1214 (2008) - 2007
- [c9]Hayato Kobayashi, Kohei Hatano, Akira Ishino, Ayumi Shinohara:
Reducing Trials by Thinning-Out in Skill Discovery. Discovery Science 2007: 127-138 - 2006
- [c8]Hayato Kobayashi, Akira Ishino, Ayumi Shinohara:
A Framework for Advanced Robot Programming in the RoboCup Domain - Using Plug-in System and Scripting Language. IAS 2006: 660-667 - [c7]Jun Inoue, Akira Ishino, Ayumi Shinohara:
Ball tracking with velocity based on Monte-Carlo localization. IAS 2006: 686-693 - [c6]Hayato Kobayashi, Tsugutoyo Osaki, Eric Williams, Akira Ishino, Ayumi Shinohara:
Autonomous Learning of Ball Trapping in the Four-Legged Robot League. RoboCup 2006: 86-97 - 2005
- [c5]Hisashi Tsuji, Akira Ishino, Masayuki Takeda:
A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's. SPIRE 2005: 388-398 - 2003
- [c4]Tomohiko Sugimachi, Akira Ishino, Masayuki Takeda, Fumihiro Matsuo:
A Method of Extracting Related Words Using Standardized Mutual Information. Discovery Science 2003: 478-485 - 2001
- [c3]Akihiro Yamamoto, Kimihito Ito, Akira Ishino, Hiroki Arimura:
Modelling Semi-structured Documents with Hedges for Deduction and Induction. ILP 2001: 240-247 - [c2]T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo:
Musical Sequence Comparison for Melodic and Rhythmic Similarities. SPIRE 2001: 111-122
1990 – 1999
- 1997
- [j1]Akira Ishino, Akihiro Yamamoto:
Generalization in Typed Equational Programming and Their Application to Learning Functions. New Gener. Comput. 15(1): 85-103 (1997) - 1994
- [c1]Akira Ishino, Akihiro Yamamoto:
Learning from Examples with Typed Equational Programming. AII/ALT 1994: 301-316
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
