Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuji Takada

dblp:01/238 · DBLP profile ↗
← Back
10ranked-venue papers
5as first author
0since 2021 · last 2017
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 2 first-authorTheory of computation · 4 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 2Databases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › language learning
formal language learning
0.011995
A Hierarchy of Language Families Learnable by Regular Language Learning · Inf. Comput. 1995
Automata and formal languages
regular languages
0.011995
A Hierarchy of Language Families Learnable by Regular Language Learning · Inf. Comput. 1995

Methods — techniques the papers use, named apart from their topics

regular language learning · 0.0
YearPublicationVenuePosition
2017 A narrow road driving assistance system based on driving style
abstract
Autonomous Driving (AD) and Advanced Driver Assistance Systems (ADAS) are being vigorously developed for improving traffic safety and transportation efficiency. AD and ADAS need to provide smooth and comfortable driving experiences to drivers and passengers as well as accommodation of other traffic. Individual drivers have different driving styles. This paper proposes a driver-adapted narrow road driving assistance system based on the driving style. The trajectory recorded for participants was used to characterize their driving style. Steering assistance gains were calculated according to the trajectory. In experiments conducted with seventeen participants, different driving styles were compared; without assistance, with the proposed driver-adapted assistance, with constant assistance, and with assistance tuned by a professional test driver. The results showed that the proposed driver-adapted assistance system provided the smoothest driving in terms of the sum of assistance force, the maximum steering angle, and steering entropy. Differences were observed by statistical analyses as well.
Yoshiro Takamatsu, Yuji Takada, Norimasa Kishi
SMC2
1998 Virtual Integration of Distributed Database by Multiple Agents
Takao Mohri, Yuji Takada
Discovery Science2
1997 Emergent media environment for idea creation support
Kozo Sugiyama, Kazuo Misue, Isamu Watanabe, Kiyoshi Nitta, Yuji Takada
Knowl. Based Syst.5
1997 Learning Deterministic even Linear Languages From Positive Examples
Takeshi Koshiba, Erkki Mäkinen, Yuji Takada
Theor. Comput. Sci.3
1995 Learning Strongly Deterministic Even Linear Languages from Positive Examples
Takeshi Koshiba, Erkki Mäkinen, Yuji Takada
ALT3
1995 A Hierarchy of Language Families Learnable by Regular Language Learning
Yuji Takada
Inf. Comput.1
1994 Learning Equal Matrix Grammars Based on Control Sets
abstract
An equal matrix grammar is a parallel rewriting system. In this paper, we consider the problem of learning equal matrix grammars from examples. We introduce a learning method based on control sets and show two subclasses learnable in polynomial time with learning methods for regular sets. We also show that for any equal matrix language there exists an equal matrix grammar learnable efficiently from positive structural examples only.
Yuji Takada
Int. J. Pattern Recognit. Artif. Intell.1
1992 Learning Semilinear Sets from Examples and via Queries
Yuji Takada
Theor. Comput. Sci.1
1988 Grammatical Inference for Even Linear Languages Based on Control Sets
Yuji Takada
ECAI1
1988 Grammatical Interface for Even Linear Languages Based on Control Sets
Yuji Takada
Inf. Process. Lett.1