default search action
Tatsuya Nagao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c14]Satoshi Ito, Yoshio Kunisawa, Takeo Ooseki, Tatsuya Nagao, Takahiro Hayashi:
Virtualized Terminal Using Terahertz-Band for Ultra High Capacity Towards Beyond 5G and 6G. APWCS 2024: 1-4 - 2023
- [j1]Keita Imaizumi, Koichi Ichige, Tatsuya Nagao, Takahiro Hayashi:
Low-Cost Learning-Based Path Loss Estimation Using Correlation Graph CNN. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(8): 1072-1076 (2023) - [c13]Rento Hagiwara, Koichi Ichige, Tatsuya Nagao, Takahiro Hayashi:
Feature Extraction Using Hough Transform in Radio Propagation Estimation. VTC Fall 2023: 1-5 - [c12]Keita Imaizumi, Koichi Ichige, Tatsuya Nagao, Takahiro Hayashi:
Low-Cost Path Loss Estimation Using Correlation Graph CNN with Novel Feature Parameters. VTC2023-Spring 2023: 1-5 - [c11]Tomofumi Kanno, Takuya Ohto, Hiromi Matsuno, Tatsuya Nagao, Takahiro Hayashi:
TOA-Based Positioning Scheme for IRS-Assisted 5G Milimeter Wave Networks. VTC Fall 2023: 1-5 - [c10]Tatsuya Nagao, Takahiro Hayashi:
RNN-Based Path Loss Modeling with Variable-Size Map Data in Urban Environments. VTC2023-Spring 2023: 1-5 - [c9]Tatsuya Nagao, Takahiro Hayashi:
Millimeter Wave Path Loss Modeling using Multi-Resolution Map Based on ResNet. VTC Fall 2023: 1-5 - 2022
- [c8]Tatsuya Nagao, Takahiro Hayashi:
A Study on Path Loss Modeling using ResNet and Pre-Training with Free Space Path Loss. PIMRC 2022: 1-5 - [c7]Kazuya Inoue, Keita Imaizumi, Koichi Ichige, Tatsuya Nagao, Takahiro Hayashi:
Learning-Based Path Loss Estimation Using Multiple Spatial Data and System Parameters. VTC Fall 2022: 1-5 - [c6]Hiromi Matsuno, Tatsuya Nagao, Takuya Ohto, Takahiro Hayashi, Michihiro Harada:
Practical Evaluation Method for Large IRS: RCS Pattern Synthesis of Sub-IRS with Mutual Coupling. VTC Fall 2022: 1-4 - [c5]Tatsuya Nagao, Takahiro Hayashi:
Fine-Tuning for Propagation Modeling of Different Frequencies with Few Data. VTC Fall 2022: 1-5 - [c4]Kazuki Takezawa, Tatsuya Nagao, Takahiro Hayashi:
A Study on Radio Propagation Characteristics at 100 GHz between the User Equipment and a Wearable Device. VTC Fall 2022: 1-6 - 2021
- [c3]Kazuya Inoue, Koichi Ichige, Tatsuya Nagao, Takahiro Hayashi:
On The Building Map for Radio Propagation Prediction Using Machine Learning. PIMRC 2021: 842-847 - [c2]Tatsuya Nagao, Takahiro Hayashi, Yoshiaki Amano:
A method for Forecasting Available Spectrum Resources with Location-Dependent Error Margin for Dynamic Spectrum Access. VTC Fall 2021: 1-5
2010 – 2019
- 2013
- [c1]Naoki Yamamoto, Eiji Hiraki, Toshihiko Tanaka, Yukiharu Yamada, Tatsuya Nagao, Yasuhiro Miyake, Yujiro Noda:
A study on GaN inverter based MHz frequency induction heating for tiny metals. IECON 2013: 5023-5027
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-10-11 17:31 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: