default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaoki Morita
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Nozomi Magome, Naoki Morita
, Shigeki Kaneko, Naoto Mitsume:
Higher-continuity s-version of finite element method with B-spline functions. J. Comput. Phys. 497: 112593 (2024)- [c9]Osuke Funabiki, Naoki Morita, Yasuyuki Yanagida:
MeiMeiRoRo. SIGGRAPH Asia XR 2024: 11:1-11:2 - 2023
- [i2]Nozomi Magome, Naoki Morita, Shigeki Kaneko, Naoto Mitsume:
Higher-continuity s-version of finite element method with B-spline functions. CoRR abs/2310.04011 (2023) - 2022
- [c8]Kenta Morita, Naoki Morita:
A spiking neural network that extracts frequent symbol patterns from time-series data with different symbol appearance intervals. SCIS/ISIS 2022: 1-6 - 2021
- [c7]Masanobu Horie, Naoki Morita, Toshiaki Hishinuma, Yu Ihara, Naoto Mitsume:
Isometric Transformation Invariant and Equivariant Graph Convolutional Networks. ICLR 2021 - 2020
- [i1]Masanobu Horie, Naoki Morita, Yu Ihara, Naoto Mitsume:
Isometric Transformation Invariant and Equivariant Graph Convolutional Networks. CoRR abs/2005.06316 (2020)
2010 – 2019
- 2019
- [c6]Kenta Morita, Haruhiko Takase, Naoki Morita, Hiroharu Kawanaka, Hidehiko Kita:
Spiking Neural Network to Extract Frequent Words from Japanese Speech Data. KES 2019: 363-371 - 2018
- [c5]Kenta Morita, Haruhiko Takase, Masachika Sawamura, Naoki Morita, Hidehiko Kita:
Extraction of Frequent Sequential Patterns from Sequence at Uneven Intervals. SCIS&ISIS 2018: 1437-1441 - 2017
- [c4]Kenta Morita, Haruhiko Takase, Naoki Morita, Hiroharu Kawanaka, Shinji Tsuruoka:
Stable Extraction of Frequent Sub-sequences from Sequential Symbol Input. KES 2017: 1901-1908 - 2016
- [j3]Naoki Morita, Gaku Hashimoto, Hiroshi Okuda:
Stabilized approximate inverse preconditioning based on A-orthogonalization process for parallel finite element analysis. JSIAM Lett. 8: 25-28 (2016) - [c3]Kenta Morita, Haruhiko Takase, Naoki Morita:
Extraction of frequent sub-sequences from sequential input using spiking neuron. ICNC-FSKD 2016: 1793-1797 - 2010
- [c2]Taisuke Nakamura, Takuma Imai, Haruhiko Takase, Naoki Morita, Hiroharu Kawanaka, Shinji Tsuruoka:
e-Learning system to support teacher's awareness for misunderstandings in quiz. IJCNN 2010: 1-5
2000 – 2009
- 2007
- [j2]Ryoichi Honbo, Youichi Murakami, Koichiro Sawa, Hiroyuki Wakabayashi, Naruhiko Inayoshi, Kyoji Inukai, Takeshi Shimoyama, Naoki Morita:
Development of the Lead-Free Brush Material for the High-Load Starter. IEICE Trans. Electron. 90-C(8): 1634-1642 (2007) - [c1]Kazutaka Noro, Haruhiko Takase, Hidehiko Kita, Terumine Hayashi, Naoki Morita:
Descriptive Answer Clustering System for Immediate Feedback. ICCE 2007: 37-40 - 2005
- [j1]Ryoichi Honbo, Koichiro Sawa, Youichi Murakami, Hiroyuki Wakabayashi, Naruhiko Inayoshi, Kyoji Inukai, Takeshi Shimoyama, Naoki Morita:
Development of the Lead-Free Carbon Brush Material for Starters. IEICE Trans. Electron. 88-C(8): 1675-1681 (2005)
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-11-26 20:43 CET 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:
