default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYasuhiro Tajima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c15]Yasuhiro Tajima, Genichiro Kikui:
An example distribution for probabilistic query learning of simple deterministic languages. ICGI 2014: 182-192- [c14]Genichiro Kikui, Yasuhiro Tajima:
The OKPU System in NTCIR11 MedNLP2: An IR Approach to ICD-10 Code Identification. NTCIR 2014 - [c13]Yasuhiro Tajima, Genichiro Kikui, Megumi Kubota, Rikako Inoue:
OPU at NTCIR-11 RecipeSearch: Japanese Recipe Pairing by Naive Bayes Estimation with Names of Ingredients. NTCIR 2014 - 2013
- [j3]Yasuhiro Tajima:
Teachability of a Subclass of Simple Deterministic Languages. IEICE Trans. Inf. Syst. 96-D(12): 2733-2742 (2013)
2000 – 2009
- 2008
- [c12]Yasuhiro Osaki, Kazutomo Shibahara, Yasuhiro Tajima, Yoshiyuki Kotani:
An Othello evaluation function based on Temporal Difference Learning using probability of winning. CIG 2008: 205-211 - [c11]Yasuhiro Tajima, Yoshiyuki Kotani:
Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries. ICGI 2008: 187-199 - 2007
- [c10]Junpei Nakamura, Yasuhiro Tajima, Yoshiyuki Kotani:
A System of Learning Links between Utterances with Meta-information in Character based Multi-party Conversation by Decision Tree. WEBIST (2) 2007: 420-424 - [c9]Yasuhiro Tajima, Yoshiyuki Kotani:
Finding Suitable Keywords for a Web Page from Caches based on Similarity and Frequency. WEBIST (2) 2007: 474-477 - 2006
- [j2]Yasuhiro Tajima, Yoshiyuki Kotani, Matsuaki Terada:
Polynomial Time Learnability of a Sub-class of Linear Languages. Inf. Media Technol. 1(1): 231-241 (2006) - [c8]Kanako Komiya
, Yasuhiro Tajima, Nobuo Inui, Yoshiyuki Kotani:
Generating a Set of Rules to Determine Honorific Expression Using Decision Tree Learning. CICLing 2006: 315-318 - 2005
- [c7]Yasuhiro Tajima, Yoshiyuki Kotani:
A Restricted Sample Distribution of Simple Deterministic Languages and its Learnability. PDPTA 2005: 427-432 - 2004
- [j1]Yasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada:
Polynomial time learning of simple deterministic languages via queries and a representative sample. Theor. Comput. Sci. 329(1-3): 203-221 (2004) - [c6]Yasuhiro Tajima, Yoshiyuki Kotani, Matsuaki Terada:
An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries. ICGI 2004: 288-289 - [c5]Yasutaka Otake, Yasuhiro Tajima, Matsuaki Terada:
A SIP-Based Voice-Mail System with Voice Recognition. ICOIN 2004: 985-994 - [c4]Yasuhiro Tajima, Yoshiyuki Kotani, Matsuaki Terada:
Polynomial Time PAC Learnability of a Sub-class of Linear Languages. PDPTA 2004: 338-344 - [c3]Kohta Ohshima, Yasuhiro Tajima, Matsuaki Terada:
A Teleconferencing System with High-Speed Stream Mixing for Voice over IP. SAINT 2004: 295-300 - 2002
- [c2]Yasuhiro Tajima, Matsuaki Terada:
A PAC Learnability of Simple Deterministic Languages. ICGI 2002: 249-260 - 2000
- [c1]Yasuhiro Tajima, Etsuji Tomita:
A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample. ICGI 2000: 284-297
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-08-27 21:57 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:
