![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Kazuhiro Saito
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Rei Sato
, Shuichiro Haruta
, Kazuhiro Saito
, Mori Kurokawa
:
QWalkVec: Node Embedding by Quantum Walk. PAKDD (1) 2024: 93-104 - 2023
- [j2]Natsuki Hamada, Kazuhiro Saito, Hideyuki Kawashima:
Applying Quantum Annealing for Shift Scheduling Problem for Call Centers. Int. J. Netw. Comput. 13(1): 2-17 (2023) - [c12]Natsuki Hamada, Kazuhiro Saito
, Hideyuki Kawashima:
Qobra: Fast Verification of Transactional Serializability with Quantum Annealing. IEEE Big Data 2023: 1322-1329 - [c11]Rei Sato, Kazuhiro Saito
, Tetsuro Nikuni, Shohei Watabe:
Embedding All Feasible Solutions of Traveling Salesman Problem by Divide-and-Conquer Quantum Search. QCE 2023: 270-271 - [c10]Pulak Ranjan Giri, Mori Kurokawa, Kazuhiro Saito
:
Quantum Negative Sampling Strategy for Knowledge Graph Embedding with Variational Circuit. QCE 2023: 280-281 - 2022
- [c9]Kei Yonekawa
, Kazuhiro Saito
, Mori Kurokawa
:
RIDEN: Neural-based Uniform Density Histogram for Distribution Shift Detection. AIMLSystems 2022: 13:1-13:9 - [c8]Natsuki Hamada, Kazuhiro Saito
, Hideyuki Kawashima:
Practical Effectiveness of Quantum Annealing for Shift Scheduling Problem. IPDPS Workshops 2022: 1-4 - [c7]Shohei Beppu, Kazuhiro Saito
, Noboru Yoshikane, Takehiro Tsuritani:
Fiber Nonlinearity Equalization with a Quantum-Enhanced Support Vector Machine. OECC/PSC 2022: 1-3 - [c6]Kazuhiro Saito
, Akihiro Kobayashi, Yuichi Ishikawa
:
Evaluating Quantum Annealing for Grouping Optimization with all Members' Compatibility. QCE 2022: 775-776 - [c5]Mori Kurokawa, Pulak Ranjan Giri, Kazuhiro Saito
:
Evaluating Variational Quantum Circuit Designs for Knowledge Graph Completion. QCE 2022: 777-778 - [c4]Mengfei Shen, Hideyuki Kawashima, Kazuhiro Saito
:
Fast Accurate Discovery of Tuple Inclusion Dependencies. SMARTCOMP 2022: 246-251 - 2021
- [c3]Kei Yonekawa, Shuichiro Haruta, Tatsuya Konishi, Kazuhiro Saito
, Hideki Asoh, Mori Kurokawa:
A Study on Metrics for Concept Drift Detection Based on Predictions and Parameters of Ensemble Model. MobiQuitous 2021: 568-581
2010 – 2019
- 2011
- [c2]Mami Tanaka, Takeshi Okuyama, Kazuhiro Saito:
Study on evaluation of muscle conditions using a mechanomyogram sensor. SMC 2011: 741-745
2000 – 2009
- 2009
- [c1]Hiroko Midorikawa, Kazuhiro Saito, Mitsuhisa Sato, Taisuke Boku:
Using a cluster as a memory resource: A fast and large virtual memory on MPI. CLUSTER 2009: 1-10 - 2006
- [j1]Tetsuya Taima, Toshihiro Yamanari, Kohjiro Hara
, Kazuhiro Saito:
Fabrication of Small-Molecular-Weight Organic Thin-Film Solar Cells by Combination of Wet and Dry Processes. IEICE Trans. Electron. 89-C(12): 1771-1774 (2006)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-05-19 00:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint