default search action
Satoshi Kamei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Suguru Kanoga
, Takayuki Hoshino
Comparison of seven shallow and deep regressors in continuous blood pressure and heart rate estimation using single-channel photoplethysmograms under three evaluation cases. Biomed. Signal Process. Control. 85: 105029 (2023)
2010 – 2019
- 2019
- [c9]Haruhiko Yamasaki, Satoshi Kamei, Tomoyuki Kuroki, Masaaki Okubo:
Adsorbed CO2 Dissociation Using Argon and Helium Nonthermal Plasma Flows. IAS 2019: 1-5 - 2013
- [j5]Kazuhito Matsuda, Go Hasegawa
A Method to Reduce Inter-ISP Transit Cost Caused by Overlay Routing Based on End-to-End Network Measurement. IEICE Trans. Inf. Syst. 96-D(2): 289-302 (2013) - [i1]Satoshi Kamei, Tsuyoshi Momose, Takeshi Inoue, Tomohiro Nishitani:
The P2P Network Experiment Council's Activities and Experiments with Application-Layer Traffic Optimization (ALTO) in Japan. RFC 6875: 1-18 (2013) - 2012
- [c8]Kazuhito Matsuda, Go Hasegawa
Centralized and distributed heuristic algorithms for application-level traffic routing. ICOIN 2012: 193-198
2000 – 2009
- 2009
- [c7]Takuro Horie, Go Hasegawa
A New Method of Proactive Recovery Mechanism for Large-Scale Network Failures. AINA 2009: 951-958 - [c6]Ryoichi Kawahara, Satoshi Kamei, Noriaki Kamiyama, Haruhisa Hasegawa, Hideaki Yoshino, Eng Keong Lua, Akihiro Nakao:
A Method of Constructing QoS Overlay Network and Its Evaluation. GLOBECOM 2009: 1-6 - [c5]Ryoichi Kawahara, Eng Keong Lua, Masato Uchida
On the Quality of Triangle Inequality Violation Aware Routing Overlay Architecture. INFOCOM 2009: 2761-2765 - 2008
- [j4]Yasuo Tamura, Shoji Kasahara
Inconsistency of logical and physical topologies for overlay networks and its effect on file transfer delay. Perform. Evaluation 65(10): 725-741 (2008) - [c4]Go Hasegawa
Emergency Communication Services Based on Overlay Networking Technologies. ICNS 2008: 159-164 - 2007
- [j3]Satoshi Kamei:
Deciding nonconstructibility of 3-balls with spanning edges and interior vertices. Discret. Math. 307(24): 3201-3206 (2007) - 2006
- [j2]Masato Uchida
QoS-Aware Overlay Routing with Limited Number of Alternative Route Candidates and Its Evaluation. IEICE Trans. Commun. 89-B(9): 2361-2374 (2006) - [c3]Masato Uchida
Performance Evaluation of QoS-Aware Routing in Overlay Network. ICOIN 2006: 925-934 - 2004
- [j1]Takumi Kimura, Satoshi Kamei:
QoS evaluation of diffserv-aware constraint-based routing schemes for multi-protocol label switching networks. Comput. Commun. 27(2): 147-152 (2004) - 2001
- [c2]Satoshi Kamei, Takumi Kimura:
Evaluation of routing algorithms and network topologies for MIPLS traffic engineering. GLOBECOM 2001: 25-29
1990 – 1999
- 1998
- [c1]Hayato Yamana
Experiments of Collecting WWW Information Using Distributed WWW Robots. SIGIR 1998: 379-380
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:53 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: