Keiichi KANEKO


An Algorithm to Evaluate Appropriateness of Still Images for Learning Concrete Nouns of a New Foreign Language
Mohammad Nehal HASNINE Masatoshi ISHIKAWA Yuki HIRAI Haruko MIYAKODA Keiichi KANEKO 
Publication:   
Publication Date: 2017/09/01
Vol. E100-D  No. 9  pp. 2156-2164
Type of Manuscript:  PAPER
Category: Educational Technology
Keyword: 
appropriate imageconcrete nounon-demand learning systemAIVASAIVAS-IRA
 Summary | Full Text:PDF(788.9KB)

Stochastic Fault-Tolerant Routing in Dual-Cubes
Junsuk PARK Nobuhiro SEKI Keiichi KANEKO 
Publication:   
Publication Date: 2017/08/01
Vol. E100-D  No. 8  pp. 1920-1921
Type of Manuscript:  LETTER
Category: Dependable Computing
Keyword: 
faulty edgeshypercubemulticomputerinterconnection networkparallel processingdependable computing
 Summary | Full Text:PDF(143.3KB)

Node-to-Node Disjoint Paths Problem in Möbius Cubes
David KOCIK Keiichi KANEKO 
Publication:   
Publication Date: 2017/08/01
Vol. E100-D  No. 8  pp. 1837-1843
Type of Manuscript:  PAPER
Category: Dependable Computing
Keyword: 
container problemhypercubemulticomputerinterconnection networkparallel processingdependable computingperformance evaluation
 Summary | Full Text:PDF(506.9KB)

Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles
Antoine BOSSARD Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2016/11/01
Vol. E99-D  No. 11  pp. 2821-2823
Type of Manuscript:  LETTER
Category: Dependable Computing
Keyword: 
torusmany-to-manyparallel systemfault-tolerancedependablesupercomputer
 Summary | Full Text:PDF(99.7KB)

Node-to-Set Disjoint Paths Problem in a Möbius Cube
David KOCIK Yuki HIRAI Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2016/03/01
Vol. E99-D  No. 3  pp. 708-713
Type of Manuscript:  PAPER
Category: Dependable Computing
Keyword: 
hypercubemulticomputerinterconnection networkparallel processingdependable computing
 Summary | Full Text:PDF(443.8KB)

The Container Problem in Bubble-Sort Graphs
Yasuto SUZUKI Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2008/04/01
Vol. E91-D  No. 4  pp. 1003-1009
Type of Manuscript:  PAPER
Category: Algorithm Theory
Keyword: 
bubble-sort graphsinternally disjoint pathspolynomial algorithmfault tolerance
 Summary | Full Text:PDF(431KB)

Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs
Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/04/01
Vol. E90-D  No. 4  pp. 716-721
Type of Manuscript:  PAPER
Category: Algorithm Theory
Keyword: 
signed permutationinterconnection networkrouting algorithmparallel processing
 Summary | Full Text:PDF(385.6KB)

An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs
Keiichi KANEKO Naoki SAWADA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/01/01
Vol. E90-D  No. 1  pp. 306-313
Type of Manuscript:  PAPER
Category: Dependable Computing
Keyword: 
burnt pancake graphsnode-to-node disjoint paths problemcontainer probleminternally disjoint pathspolynomial time algorithm
 Summary | Full Text:PDF(534.8KB)

Node-Disjoint Paths Algorithm in a Transposition Graph
Yasuto SUZUKI Keiichi KANEKO Mario NAKAMORI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/10/01
Vol. E89-D  No. 10  pp. 2600-2605
Type of Manuscript:  PAPER
Category: Algorithm Theory
Keyword: 
interconnection networksgraph algorithmstransposition graphsnode-to-set disjoint pathsparallel computing
 Summary | Full Text:PDF(331.3KB)

An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs
Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/02/01
Vol. E89-D  No. 2  pp. 647-653
Type of Manuscript:  Special Section PAPER (Special Section on Parallel/Distributed Computing and Networking)
Category: Parallel/Distributed Algorithms
Keyword: 
node-to-set disjoint paths problembi-rotator graphsfault toleranceparallel computationrouting algorithm
 Summary | Full Text:PDF(348.5KB)

Internally-Disjoint Paths Problem in Bi-Rotator Graphs
Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/07/01
Vol. E88-D  No. 7  pp. 1678-1684
Type of Manuscript:  PAPER
Category: Dependable Computing
Keyword: 
container probleminternally-disjoint pathsbi-rotator graphsfault toleranceparallel computation
 Summary | Full Text:PDF(386.4KB)

An Algorithm for Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs
Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/12/01
Vol. E86-D  No. 12  pp. 2588-2594
Type of Manuscript:  Special Section PAPER (Special Issue on Dependable Computing)
Category: Dependable Communication
Keyword: 
burnt pancake graphdisjoint pathspolynomial algorithmfault tolerancerouting algorithm
 Summary | Full Text:PDF(330.8KB)

Minimum Feedback Node Sets in Trivalent Cayley Graphs
Yasuto SUZUKI Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/09/01
Vol. E86-D  No. 9  pp. 1634-1636
Type of Manuscript:  Special Section LETTER (Special Issue on Parallel and Distributed Computing, Applications and Technologies)
Category: 
Keyword: 
feedback node settrivalent Cayley graphsinterconnection networks
 Summary | Full Text:PDF(143.8KB)

Node-to-Set Disjoint Paths Problem in Pancake Graphs
Keiichi KANEKO Yasuto SUZUKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/09/01
Vol. E86-D  No. 9  pp. 1628-1633
Type of Manuscript:  Special Section PAPER (Special Issue on Parallel and Distributed Computing, Applications and Technologies)
Category: Algorithms and Applications
Keyword: 
interconnection networksgraph algorithmspancake graphnode-to-set disjoint pathsparallel computing
 Summary | Full Text:PDF(327.6KB)

An Algorithm for Node-Disjoint Paths in Pancake Graphs
Yasuto SUZUKI Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/03/01
Vol. E86-D  No. 3  pp. 610-615
Type of Manuscript:  PAPER
Category: Algorithms
Keyword: 
pancake graphsnode-to-node disjoint paths probleminterconnection networksparallel and distributed processing
 Summary | Full Text:PDF(533.3KB)

An Algorithm for Node-to-Set Disjoint Paths Problem in Rotator Graphs
Keiichi KANEKO Yasuto SUZUKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/09/01
Vol. E84-D  No. 9  pp. 1155-1163
Type of Manuscript:  PAPER
Category: Algorithms
Keyword: 
rotator graphsnode-to-set disjoint paths probleminterconnection networkparallel and distributed processing
 Summary | Full Text:PDF(478.4KB)

Fault-Tolerant Routing Algorithms for Hypercube Interconnection Networks
Keiichi KANEKO Hideo ITO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/01/01
Vol. E84-D  No. 1  pp. 121-128
Type of Manuscript:  PAPER
Category: Fault Tolerance
Keyword: 
hypercube interconnection networksfault-tolerant routingfull reachabilityHamming distancecommunication
 Summary | Full Text:PDF(319.8KB)

HCC: Generalized Hierarchical Completely-Connected Networks
Toshinori TAKABATAKE Keiichi KANEKO Hideo ITO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/06/25
Vol. E83-D  No. 6  pp. 1216-1224
Type of Manuscript:  PAPER
Category: Computer Systems
Keyword: 
interconnection networksgeneralized network, hierarchical networkcompletely-connected networkrouting strategy
 Summary | Full Text:PDF(910.8KB)

Dynamic Constructive Fault Tolerant Algorithm for Feedforward Neural Networks
Nait Charif HAMMADI Toshiaki OHMAMEUDA Keiichi KANEKO Hideo ITO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1998/01/25
Vol. E81-D  No. 1  pp. 115-123
Type of Manuscript:  PAPER
Category: Bio-Cybernetics and Neurocomputing
Keyword: 
feedforward neural networkdynamic constructive algorithmfault toleranceDCFTA
 Summary | Full Text:PDF(776.6KB)