Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Keisuke Kinoshita

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 Jahn Heymann

> Home > Persons > Keisuke Kinoshita

Publications

2019
[c86]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/HeymannDHKN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/HeymannDHKN19
Jahn Heymann, Lukas Drude, Reinhold Haeb-Umbach, Keisuke Kinoshita, Tomohiro Nakatani:
Joint Optimization of Neural Network-based WPE Dereverberation and Acoustic Model for Robust Online ASR. ICASSP 2019: 6655-6659
2018
[c70]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/interspeech/DrudeBHHKDN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/interspeech/DrudeBHHKDN18
Lukas Drude, Christoph Böddeker, Jahn Heymann, Reinhold Haeb-Umbach, Keisuke Kinoshita, Marc Delcroix, Tomohiro Nakatani:
Integrating Neural Network Based Beamforming and Weighted Prediction Error Dereverberation. INTERSPEECH 2018: 3043-3047
[c67]
- view
  authority control:
- export record
  dblp key:
  - conf/iwaenc/HeymannDHKN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwaenc/HeymannDHKN18
Jahn Heymann, Lukas Drude, Reinhold Haeb-Umbach, Keisuke Kinoshita, Tomohiro Nakatani:
Frame-Online DNN-WPE Dereverberation. IWAENC 2018: 466-470

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.