Sciweavers

CSL
2010
Springer
13 years 9 months ago
The Hidden Information State model: A practical framework for POMDP-based spoken dialogue management
This paper explains how Partially Observable Markov Decision Processes (POMDPs) can provide a principled mathematical framework for modelling the inherent uncertainty in spoken di...
Steve Young, Milica Gasic, Simon Keizer, Fran&cced...
CSL
2010
Springer
13 years 9 months ago
Bayesian update of dialogue state: A POMDP framework for spoken dialogue systems
This paper describes a statistically motivated framework for performing real-time dialogue state updates and policy learning in a spoken dialogue system. The framework is based on...
Blaise Thomson, Steve Young
CSL
2010
Springer
13 years 9 months ago
Monaural speech separation based on MAXVQ and CASA for robust speech recognition
Robustness is one of the most important topics for automatic speech recognition (ASR) in practical applications. Monaural speech separation based on computational auditory scene a...
Peng Li, Yong Guan, Shijin Wang, Bo Xu, Wenju Liu
CSL
2010
Springer
13 years 9 months ago
A computational auditory scene analysis system for speech segregation and robust speech recognition
A conventional automatic speech recognizer does not perform well in the presence of multiple sound sources, while human listeners are able to segregate and recognize a signal of i...
Yang Shao, Soundararajan Srinivasan, Zhaozhang Jin...
CSL
2010
Springer
13 years 9 months ago
Discriminative training of HMMs for automatic speech recognition: A survey
Recently, discriminative training (DT) methods have achieved tremendous progress in automatic speech recognition (ASR). In this survey article, all mainstream DT methods in speech...
Hui Jiang
CSL
2010
Springer
13 years 9 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
CSL
2010
Springer
13 years 9 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann
CSL
2010
Springer
13 years 10 months ago
Classical and Intuitionistic Subexponential Logics Are Equally Expressive
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented i...
Kaustuv Chaudhuri
CSL
2010
Springer
13 years 10 months ago
Automata vs. Logics on Data Words
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
Michael Benedikt, Clemens Ley, Gabriele Puppis
CSL
2010
Springer
13 years 10 months ago
Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries
Abstract. We present a symbolic framework, based on a modular operational semantics, for formalizing different notions of compromise relevant for the analysis of cryptographic prot...
David A. Basin, Cas J. F. Cremers