( en | de | ru )

 

Disambiguation of "Kaneko, Keiichi"

Author of the publication

copydeleteadd this publication to your clipboard
A support system for probability learning based on scaffolding approach.

, , and . ITI, page 205-210. IEEE, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tanja Kaneko

Keiichi Kato

Gaël Kaneko

Kiosuke Kaneko

Keiichi Yamada

 

Other publications of authors with the same name

Node-disjoint Paths in a Transposition Graph., , and . PDPTA, page 298-304. CSREA Press, (2004)Hamiltonian Paths and Cycles in Faulty Burnt Pancake Graphs.. PDPTA, page 253-259. CSREA Press, (2006)Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs.. SNPD, page 285-292. ACIS, (2003)The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes., and . Comput. J., 55 (6): 769-775 (2012)Set-to-set disjoint-path routing in perfect hierarchical hypercubes., and . C3S2E, page 51-57. ACM, (2011)Container Problem in Burnt Pancake Graphs., , and . ISPA, volume 3758 of Lecture Notes in Computer Science, page 479-490. Springer, (2005)Learners' Self Checking and Its Effectiveness in Conceptual Data Modeling Exercises., , , , , and . IEICE Trans. Inf. Syst., 101-D (7): 1801-1810 (2018)Elicitation of Appropriate Scratching Zones Based on Lecture Slide Layouts., , , , , and . HCI (22), volume 11587 of Lecture Notes in Computer Science, page 430-441. Springer, (2019)Node-to-Set Disjoint Paths Problem in Rotator Graphs., and . ASIAN, volume 1961 of Lecture Notes in Computer Science, page 119-132. Springer, (2000)Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes., and . ICA3PP (1), volume 7016 of Lecture Notes in Computer Science, page 106-116. Springer, (2011)