default search action
Satoshi Yoshida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j13]Satoshi Yoshida
, Akihito Soeda
Universal construction of decoders from encoding black boxes. Quantum 7: 957 (2023) - 2022
- [c17]Satoshi Yoshida, Ken'ichi Furuya
Introducing Speaker Vectors for Child Speech Synthesis in Neural Vocoders. CISIS 2022: 538-547 - [c16]Satoshi Yoshida, Ken'ichi Furuya
Quality Improvement of Children's Speech by Speaker Vector in General Purpose Vocoder. GCCE 2022: 393-394 - 2021
- [c15]Satoshi Yoshida, Shingo Uenohara, Keisuke Nishijima, Ken'ichi Furuya
Voice Quality Change Due to the Amount of Training Data for Multi- and Target-Speaker WaveNet Vocoders. CISIS 2021: 727-733 - 2020
- [j12]Satoshi Yoshida
Experimental Verification of Excavated Structure on Multi-Layered Substrates for Millimeter-Wave Signal Vertical Transition Using Copper Balls. IEEE Access 8: 2362-2372 (2020) - [c14]Satoshi Yoshida, Qiang Ma
Generating Dialogue Sentences to Promote Critical Thinking. DEXA (1) 2020: 354-368
2010 – 2019
- 2019
- [c13]Satoshi Yoshida, Jianquan Liu, Shoji Nishimura:
A Robust People Tracking Method in Multiple Cameras. BigMM 2019: 305-308 - [c12]Satoshi Yoshida, Shoji Nishimura, Jianquan Liu:
A Fast and Robust Re-Identification Method for Large Video Data. MIPR 2019: 252-257 - 2015
- [j11]Hironori Okubo, Toshiyuki Miyamoto, Satoshi Yoshida, Kazuyuki Mori, Shoichi Kitamura, Yoshio Izui:
Project scheduling under partially renewable resources and resource consumption during setup operations. Comput. Ind. Eng. 83: 91-99 (2015) - [j10]Satoshi Yoshida, Takuya Kida:
An efficient Variable-to-Fixed length encoding using multiplexed parse trees. J. Discrete Algorithms 32: 75-86 (2015) - 2014
- [c11]Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, Takuya Kida:
Adaptive Dictionary Sharing Method for Re-Pair Algorithm. DCC 2014: 425 - [c10]Satoshi Yoshida, Hirohito Sasakawa, Kei Sekine, Takuya Kida:
Direct Access to Variable-to-Fixed Length Codes with a Succinct Index. DCC 2014: 436 - [c9]Yuya Suzuki, Satoshi Yoshida
Hetero-plane beam synthesis using 60 GHz band 3-D phased array antenna module. RWS 2014: 34-36 - 2013
- [j9]Yuta Kobayashi, Satoshi Yoshida, Zen-ichi Yamamoto, Shigeo Kawasaki:
S-Band GaN on Si Based 1kW-Class SSPA System for Space Wireless Applications. IEICE Trans. Electron. 96-C(10): 1245-1253 (2013) - [j8]Satoshi Yoshida, Takuya Kida:
A Variable-length-to-fixed-length Coding Method Using a Re-Pair Algorithm. Inf. Media Technol. 8(4): 971-977 (2013) - [c8]Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, Takuya Kida:
Variable-to-Fixed-Length Encoding for Large Texts Using Re-Pair Algorithm with Shared Dictionaries. DCC 2013: 518 - [c7]Satoshi Yoshida, Takuya Kida:
Effective Variable-Length-to-Fixed-Length Coding via a Re-Pair Algorithm. DCC 2013: 532 - [c6]Shigeo Kawasaki, Yuta Kobayashi, Satoshi Yoshida
High-power, high-efficiency microwave circuits and modules for wireless power transfer based on green-Eco technology. RWS 2013: 28-30 - 2012
- [j7]Noriharu Suematsu, Satoshi Yoshida, Shoichi Tanifuji, Suguru Kameda
A 60 GHz-Band 3-Dimensional System-in-Package Transmitter Module with Integrated Antenna. IEICE Trans. Electron. 95-C(7): 1141-1146 (2012) - [j6]Satoshi Yoshida, Shoichi Tanifuji, Suguru Kameda
60-GHz Band Copper Ball Vertical Interconnection for MMW 3-D System-in-Package Front-End Modules. IEICE Trans. Electron. 95-C(7): 1276-1284 (2012) - [j5]Satoshi Yoshida, Takashi Uemura, Takuya Kida, Tatsuya Asai, Seishi Okamoto:
Improving Parse Trees for Efficient Variable-to-Fixed Length Codes. Inf. Media Technol. 7(1): 129-140 (2012) - [j4]Satoshi Yoshida, Takashi Uemura, Takuya Kida, Tatsuya Asai, Seishi Okamoto:
Improving Parse Trees for Efficient Variable-to-Fixed Length Codes. J. Inf. Process. 20(1): 238-249 (2012) - [c5]Satoshi Yoshida, Takuya Kida:
Analysis of Multiplexed Parse Trees for Almost Instantaneous VF Codes. IIAI-AAI 2012: 36-41 - 2011
- [c4]Satoshi Yoshida, Takuya Kida:
On Performance of Compressed Pattern Matching on VF Codes. DCC 2011: 486 - 2010
- [j3]Satoshi Yoshida:
Effective reactions against disruptive innovations - the case of Japan's electronics industry. Int. J. Technol. Manag. 50(2): 119-138 (2010) - [j2]Satoshi Someya, Satoshi Yoshida, Koji Okamoto
Jet ejection from droplets near the Leidenfrost temperature. J. Vis. 13(1): 41-47 (2010) - [c3]Satoshi Yoshida, Takuya Kida:
An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree. DCC 2010: 219-228 - [c2]Takashi Uemura, Satoshi Yoshida, Takuya Kida, Tatsuya Asai, Seishi Okamoto:
Training Parse Trees for Efficient VF Coding. SPIRE 2010: 179-184
2000 – 2009
- 2008
- [j1]Kazuya Shimoyama, Satoshi Yoshida, Tuan Thanh Ta, Keisuke Matsuzaki, Hiroshi Oguma, Suguru Kameda
5GHz Si-CMOS differential power amplifier module with directly connected dipole antenna. IEICE Electron. Express 5(7): 229-234 (2008) - 2003
- [c1]Genki Shimomura, Yasutaka Mori, Satoshi Yoshida, Masa Inakage:
Item.tv: online game of "symphonic" media. SIGGRAPH Web Graphics 2003
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-07 21:22 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: