Koichi Shinoda

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 Chin-Hui Lee

> Home > Persons > Koichi Shinoda

Publications

2010
[c36]
- view
  - electronic edition @ nist.gov (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/trecvid/InoueWKSKBL10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/trecvid/InoueWKSKBL10
Nakamasa Inoue, Toshiya Wada, Yusuke Kamishima, Koichi Shinoda, Ilseo Kim, Byungki Byun, Chin-Hui Lee:
TT+GT at TRECVID 2010 Workshop. TRECVID 2010
2009
[c31]
- view
  - electronic edition @ nist.gov (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/trecvid/InoueHSSKL09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/trecvid/InoueHSSKL09
Nakamasa Inoue, Shanshan Hao, Tatsuhiko Saito, Koichi Shinoda, Ilseo Kim, Chin-Hui Lee:
TITGT at TRECVID 2009 Workshop. TRECVID 2009
2001
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/taslp/ShinodaL01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/taslp/ShinodaL01
Koichi Shinoda, Chin-Hui Lee:
A structural Bayes approach to speaker adaptation. IEEE Trans. Speech Audio Process. 9(3): 276-287 (2001)
1998
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/ShinodaL98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/ShinodaL98
Koichi Shinoda, Chin-Hui Lee:
Unsupervised adaptation using structural Bayes approach. ICASSP 1998: 793-796

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.