Kazuo Hiraki

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Shogo Nabe

> Home > Persons > Kazuo Hiraki

Publications

2008
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/arobots/KandaNHIH08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arobots/KandaNHIH08
Takayuki Kanda, Shogo Nabe, Kazuo Hiraki, Hiroshi Ishiguro, Norihiro Hagita:
Human friendship estimation model for communication robots. Auton. Robots 24(2): 135-145 (2008)
2006
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/hri/NabeKHIKH06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hri/NabeKHIKH06
Shogo Nabe, Takayuki Kanda, Kazuo Hiraki, Hiroshi Ishiguro, Kiyoshi Kogure, Norihiro Hagita:
Analysis of human behavior to a communication robot in an open field. HRI 2006: 234-241
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/ro-man/NabeCKHIH06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ro-man/NabeCKHIH06
Shogo Nabe, Stephen J. Cowley, Takayuki Kanda, Kazuo Hiraki, Hiroshi Ishiguro, Norihiro Hagita:
Robots as social mediators: coding for engineers. RO-MAN 2006: 384-390
2005
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/humanoids/NabeKHIH05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/humanoids/NabeKHIH05
Shogo Nabe, Takayuki Kanda, Kazuo Hiraki, Hiroshi Ishiguro, Norihiro Hagita:
Human friendship estimation model for communication robots. Humanoids 2005: 196-201

a service of

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.