Keiichi Kaneko

According to our database1, Keiichi Kaneko authored at least 91 papers between 1999 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
A stochastic link-fault-tolerant routing algorithm in folded hypercubes.
The Journal of Supercomputing, 2018

Fault-tolerant Routing based on Routing Capabilities in a Hyper-Star Graph.
J. Inf. Sci. Eng., 2018

Learners' Self Checking and Its Effectiveness in Conceptual Data Modeling Exercises.
IEICE Transactions, 2018

Proposal of an Unrestricted Character Encoding for Japanese.
Proceedings of the Databases and Information Systems, 2018

2017
A Set-to-Set Disjoint Paths Routing Algorithm in Tori.
IJNC, 2017

Stochastic Fault-Tolerant Routing in Dual-Cubes.
IEICE Transactions, 2017

A Support System for Solving Problems of Two-Triangle Congruence Using 'Backward Chaining'.
IEICE Transactions, 2017

Node-to-Node Disjoint Paths Problem in Möbius Cubes.
IEICE Transactions, 2017

An Algorithm to Evaluate Appropriateness of Still Images for Learning Concrete Nouns of a New Foreign Language.
IEICE Transactions, 2017

2016
Node-to-Set Disjoint Paths Problem in a Möbius Cube.
IEICE Transactions, 2016

Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles.
IEICE Transactions, 2016

A Method for Collecting Learners' Thinking Process in ER Modeling Exercises and Its Application Experiment.
Proceedings of the 2016 Intl IEEE Conferences on Ubiquitous Intelligence & Computing, 2016

Set-to-Set Disjoint Paths in Tori.
Proceedings of the Fourth International Symposium on Computing and Networking, 2016

2015
A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint.
IJNDC, 2015

Hypercube Fault Tolerant Routing with Bit Constraint.
IJNC, 2015

Node-to-set disjoint paths routing in a metacube.
IJHPCN, 2015

Torus-Connected Cycles: A Simple And Scalable Topology For Interconnection Networks.
Applied Mathematics and Computer Science, 2015

Ambient Conversation Support in Small Face-to-Face Group Meetings.
Proceedings of the Sixth International Symposium on Information and Communication Technology, 2015

On Solving the Container Problem in a Hypercube with Bit Constraint.
Proceedings of the Software Engineering, 2015

A learning system of Quadratic Functions based on scaffolding support.
Proceedings of the 2015 International Conference on Information Technology Based Higher Education and Training, 2015

2014
k-pairwise disjoint paths routing in perfect hierarchical hypercubes.
The Journal of Supercomputing, 2014

Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes.
J. Inf. Sci. Eng., 2014

Fault-tolerant routing based on approximate directed routable probabilities for hypercubes.
Future Generation Comp. Syst., 2014

Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks.
Comput. J., 2014

Fault-Tolerant Routing Based on Improved Safety Levels in Pancake Graphs.
Proceedings of the 15th International Conference on Parallel and Distributed Computing, 2014

Fault-Tolerant Routing in (n, k) - Star Graphs.
Proceedings of the 15th International Conference on Parallel and Distributed Computing, 2014

The Container Problem in a Torus-connected Cycles Network.
Proceedings of the International Conference on Computational Science, 2014

On Hypercube Routing and Fault Tolerance with Bit Constraint.
Proceedings of the Second International Symposium on Computing and Networking, 2014

2013
A support system for probability learning based on scaffolding approach.
Proceedings of the ITI 2013 35th International Conference on Information Technology Interfaces, 2013

Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2013

2012
Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks.
Comput. J., 2012

The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes.
Comput. J., 2012

A learning system for matrix operations by interactive drilling.
Proceedings of the 34th International Conference on Information Technology Interfaces, 2012

2011
Node-to-set disjoint-path routing in perfect hierarchical hypercubes.
Proceedings of the International Conference on Computational Science, 2011

Effective learning material for mobile devices: Visual data vs. Aural data vs. Text data.
JLCL, 2011

A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes.
Comput. J., 2011

A Multilingual Chat System with Image Presentation for Detecting Mistranslation.
CIT, 2011

A routing algorithm of pairwise disjoint paths in a burnt pancake graph.
Proceedings of the 2011 Symposium on Information and Communication Technology, 2011

Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs.
Proceedings of the ISCA 26th International Conference on Computers and Their Applications, 2011

Set-to-set disjoint-path routing in perfect hierarchical hypercubes.
Proceedings of the Fourth International C* Conference on Computer Science & Software Engineering, 2011

2010
Fault-tolerant routing in burnt pancake graphs.
Inf. Process. Lett., 2010

Effective Materials for Abstract Words in Foreign Vocabulary Learning.
Proceedings of the 6th IEEE International Conference on Wireless, 2010

A Feedback Vertex Set on Pancake Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010

Set-to-Set Disjoint-Path Routing in Metacube.
Proceedings of the 2010 International Conference on Parallel and Distributed Computing, 2010

Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2010

Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2010

2009
A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2009

Node-to-Set Disjoint-path Routing in Metacube.
Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

Two New Algorithms for Software Watermarking by Register Allocation and their Empirical Evaluation.
Proceedings of the Sixth International Conference on Information Technology: New Generations, 2009

Automatic creation of materials for vocabulary learning based on pictures by mobile phones of learners.
Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces, 2009

A Node-to-Set Disjoint-Path Routing Algorithm in Metacube.
Proceedings of the 10th International Symposium on Pervasive Systems, 2009

2008
The Container Problem in Bubble-Sort Graphs.
IEICE Transactions, 2008

New Approaches for Software Watermarking by Register Allocation.
Proceedings of the Ninth ACIS International Conference on Software Engineering, 2008

Design of a web-based visual simulator and its evaluation based on real computer education.
Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, 2008

A New Configuration of an Incomplete Star Graph and its Routing Algorithm.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008

Set-to-Set Disjoint Paths Routing in Dual-Cubes.
Proceedings of the Ninth International Conference on Parallel and Distributed Computing, 2008

Autonomous and collaborative learning environment for vocabulary acquirement.
Proceedings of the ITI 2008 30th International Conference on Information Technology Interfaces, 2008

Node-to-Set Disjoint Paths Routing in Dual-Cube.
Proceedings of the 9th International Symposium on Parallel Architectures, 2008

Design and Management of Material Sharing System for Ubiquitous Vocabulary Learning.
Proceedings of the 8th IEEE International Conference on Advanced Learning Technologies, 2008

2007
An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs.
IEICE Transactions, 2007

Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs.
IEICE Transactions, 2007

An (n, k)-Pancake Graph and its Properties.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007

Pairwise Disjoint Paths in Pancake Graphs.
Proceedings of the Eighth International Conference on Parallel and Distributed Computing, 2007

A Web-based Visual Simulator with Communication Support and its Application to Computer Architecture Education.
Proceedings of the 7th IEEE International Conference on Advanced Learning Technologies, 2007

Long-term Memory of Foreign-word Learning by Short Movies for iPods.
Proceedings of the 7th IEEE International Conference on Advanced Learning Technologies, 2007

A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs.
Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems, 2007

2006
An algorithm for disjoint paths in bubble-sort graphs.
Systems and Computers in Japan, 2006

Node-Disjoint Paths Algorithm in a Transposition Graph.
IEICE Transactions, 2006

An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs.
IEICE Transactions, 2006

Application of a Visual Computer Simulator into Collaborative Learning.
CIT, 2006

Routing Problems in Incomplete Pancake Graphs.
Proceedings of the Seventh International Conference on Software Engineering, 2006

Routing Problems in Incomplete Rotator Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications & Conference on Real-Time Computing Systems and Applications, 2006

Hamiltonian Paths and Cycles in Faulty Burnt Pancake Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications & Conference on Real-Time Computing Systems and Applications, 2006

Disjoint Paths Routing in Pancake Graphs.
Proceedings of the Seventh International Conference on Parallel and Distributed Computing, 2006

Computing the Diameter of 17-Pancake Graph Using a PC Cluster.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

Design and Implementation of a Dependable Interpreter for Functional Programs.
Proceedings of the 21st International Conference on Computers and Their Applications, 2006

2005
Internally-Disjoint Paths Problem in Bi-Rotator Graphs.
IEICE Transactions, 2005

Computing the Diameters of 14- and 15-Pancake Graphs.
Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Container Problem in Burnt Pancake Graphs.
Proceedings of the Parallel and Distributed Processing and Applications, 2005

Hamiltonian Cycles and Paths in Burnt Pancake Graphs.
Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, 2005

2004
Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs.
Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2004), 2004

Node-disjoint Paths in a Transposition Graph.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

Container Problem in Bi-rotator Graphs.
Proceedings of the Parallel and Distributed Computing: Applications and Technologies, 2004

Container Problem in Substring Reversal Graphs.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs.
Proceedings of the Parallel and Distributed Processing and Applications, 2004

2003
Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs.
Proceedings of the ACIS Fourth International Conference on Software Engineering, 2003

2000
Node-to-Set Disjoint Paths Problem in Rotator Graphs.
Proceedings of the Advances in Computing Science, 2000

1999
LLT and LTn Schemes: Error Recovery Schemes in Mobile Environments.
Proceedings of the 1999 Pacific Rim International Symposium on Dependable Computing (PRDC 1999), 1999

Generalized Hierarchical Completely-Connected Networks.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

Fault-Tolerant Routing Algorithms for Hypercube Networks.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999


  Loading...