E-LIB Suche - Ergebnisse für: Keiichi Kaneko

1

Hypercube Fault Tolerant Routing with Bit Constraint:

Bossard, Antoine ; Keiichi, Kaneko
International Journal of Networking and Computing. 5 (2015) 2 - p. 272-289 , 2015

Link: https://doi.org/10.15803..

2

Analysis of Code Writing Problem Solution Results in C Prog..:

, In: 2024 IEEE International Conference on Consumer Electronics (ICCE),

Kyaw, Htoo Htoo Sandi ; Kaneko, Keiichi ; Funabiki, Nobuo - p. 1-5 , 2024

Link: https://doi.org/10.1109/..

3

Set-to-set disjoint paths in a folded hypercube:

Ichida, Hiroyuki ; Kaneko, Keiichi
Theoretical Computer Science. 1000 (2024) - p. 114562 , 2024

Link: https://doi.org/10.1016/..

4

Node-to-Set Disjoint Paths Problem in Cross-Cubes:

SASAKI, Rikuya ; ICHIDA, Hiroyuki ; KYAW, Htoo Htoo Sandi.
IEICE Transactions on Information and Systems. E107.D (2024) 1 - p. 53-59 , 2024

Link: https://doi.org/10.1587/..

5

Feedback Node Sets in Pancake Graphs and Burnt Pancake Grap..:

JUNG, Sinyu ; KANEKO, Keiichi
IEICE Transactions on Information and Systems. E106.D (2023) 10 - p. 1677-1685 , 2023

Link: https://doi.org/10.1587/..

6

Fault-tolerant Routing Methods in Bicubes:

, In: 2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE),

Wang, Yitong ; Kyaw, Htoo Htoo Sandi ; Kaneko, Keiichi - p. 2093-2100 , 2023

Link: https://doi.org/10.1109/..

7

A report of three cases of patients with tubulointerstitial..:

Akagi, Ryota ; Ishii, Akira ; Kaneko, Keiichi...
BMC Nephrology. 24 (2023) 1 - p. , 2023

Link: https://doi.org/10.1186/..

8

On the Crossing Number of a Torus Network:

BOSSARD, Antoine ; KANEKO, Keiichi ; HARRIS, JR., Frederick C.
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E106.A (2023) 1 - p. 35-44 , 2023

Link: https://doi.org/10.1587/..

9

Set-to-Set Disjoint Path Routing in Bijective Connection Gr..:

Kaneko, Keiichi ; Bossard, Antoine ; Harris, Frederick C.
IEEE Access. 10 (2022) - p. 72731-72742 , 2022

Link: https://doi.org/10.1109/..

10

Minimal Paths in a Bicube:

OKADA, Masaaki ; KANEKO, Keiichi
IEICE Transactions on Information and Systems. E105.D (2022) 8 - p. 1383-1392 , 2022

Link: https://doi.org/10.1587/..

11

An Implementation of Coding Rule Checking Function for C Pr..:

, In: 2022 IEEE 4th Global Conference on Life Sciences and Technologies (LifeTech),

Kyaw, Htoo Htoo Sandi ; Kaneko, Keiichi ; Funabiki, Nobuo. - p. 133-134 , 2022

Link: https://doi.org/10.1109/..

12

Set-to-Set Disjoint Paths Problem in Möbius Cubes:

Ichida, Hiroyuki ; Kaneko, Keiichi
IEEE Access. 10 (2022) - p. 83075-83084 , 2022

Link: https://doi.org/10.1109/..

13

Lineage tracing analysis defines erythropoietin-producing c..:

Kaneko, Keiichi ; Sato, Yuki ; Uchino, Eiichiro...
Kidney International. 102 (2022) 2 - p. 280-292 , 2022

Link: https://doi.org/10.1016/..

14

A Shortest-Path Routing Algorithm in Bicubes:

, In: Advances in Parallel & Distributed Processing, and Applications; Transactions on Computational Science and Computational Intelligence,

Okada, Masaaki ; Kaneko, Keiichi - p. 525-539 , 2021

Link: https://doi.org/10.1007/..

15

Going Beyond Computer-Assisted Vocabulary Learning: Researc..:

, In: Distributed, Ambient and Pervasive Interactions; Lecture Notes in Computer Science,

Nehal Hasnine, Mohammad ; Ishikawa, Masatoshi ; Mouri, Kousuke. - p. 610-623 , 2020

Link: https://doi.org/10.1007/..