default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenichi Kobayashi 0001
Person information
- affiliation: Fujitsu Laboratory Ltd., Kanagawa, Japan
Other persons with the same name
- Kenichi Kobayashi 0002 — Tokyo University of Science, Japan
- Kenichi Kobayashi 0003 — Kanagawa University, Yokohama, Japan
- Kenichi Kobayashi 0004 — Chuo University, Japan
- Kenichi Kobayashi 0005 — Toyohashi University of Technology, Toyohashi, Aichi, Japan
- Kenichi Kobayashi 0006 — Nippon Institute of Technology, Japan
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Hiroaki Kingetsu, Kenichi Kobayashi, Taiji Suzuki:
Neural Network Module Decomposition and Recomposition with Superimposed Masks. IJCNN 2023: 1-10- [c9]Keizaburo Nishikino, Kenichi Kobayashi:
Adversarial Imitation Learning with Controllable Rewards for Text Generation. ECML/PKDD (1) 2023: 131-146 - 2022
- [c8]Hiroaki Kingetsu, Kenichi Kobayashi
, Yoshihiro Okawa, Yasuto Yokota, Katsuhito Nakazawa:
Multi-Step Test-Time Adaptation with Entropy Minimization and Pseudo-Labeling. ICIP 2022: 4153-4157 - 2021
- [c7]Hiroaki Kingetsu, Kenichi Kobayashi:
Born-Again Decision Boundary: Unsupervised Concept Drift Detection by Inspector Neural Network. IJCNN 2021: 1-8 - [c6]Yoshihiro Okawa, Kenichi Kobayashi:
Concept Drift Detection via Boundary Shrinking. IJCNN 2021: 1-8 - [i5]Hiroaki Kingetsu, Kenichi Kobayashi, Taiji Suzuki:
Neural Network Module Decomposition and Recomposition. CoRR abs/2112.13208 (2021)
2010 – 2019
- 2019
- [i4]Yasuo Yamane, Kenichi Kobayashi:
A New Fast Weighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees. CoRR abs/1908.06798 (2019) - [i3]Yasuo Yamane, Kenichi Kobayashi:
A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees. CoRR abs/1908.06806 (2019) - 2013
- [c5]Kenichi Kobayashi, Manabu Kamimura, Keisuke Yano, Koki Kato, Akihiko Matsuo:
SArF map: Visualizing software architecture from feature and layer viewpoints. ICPC 2013: 43-52 - [i2]Kenichi Kobayashi, Manabu Kamimura, Keisuke Yano, Koki Kato, Akihiko Matsuo:
SArF Map: Visualizing Software Architecture from Feature and Layer Viewpoints. CoRR abs/1306.0958 (2013) - [i1]Kenichi Kobayashi, Manabu Kamimura, Koki Kato, Keisuke Yano, Akihiko Matsuo:
Feature-Gathering Dependency-Based Software Clustering Using Dedication and Modularity. CoRR abs/1306.2096 (2013) - 2012
- [c4]Kenichi Kobayashi, Manabu Kamimura, Koki Kato, Keisuke Yano, Akihiko Matsuo:
Feature-gathering dependency-based software clustering using Dedication and Modularity. ICSM 2012: 462-471 - [c3]Yusuke Sasaki, Yoshiharu Maeda, Kenichi Kobayashi, Akihiko Matsuo:
Applying Test Data Generation Using SMT Solver to COBOL. ISSRE Workshops 2012: 82 - 2011
- [c2]Kenichi Kobayashi, Akihiko Matsuo, Katsuro Inoue, Yasuhiro Hayase, Manabu Kamimura, Toshiaki Yoshino:
ImpactScale: Quantifying change impact to predict faults in large software systems. ICSM 2011: 43-52
2000 – 2009
- 2003
- [c1]Yukiko Yoshida, Yuiko Ohta, Kenichi Kobayashi, Nobuhiro Yugami:
Mining Interesting Patterns Using Estimated Frequencies from Subpatterns and Superpatterns. Discovery Science 2003: 494-501
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-25 05:56 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:
