96
Voted
TASLP
2016
9 years 11 months ago
2016
Abstract—This paper presents a parametric Bayesian approach to the statistical analysis of phoneme confusion matrices measured for groups of individual listeners in one or more t...
87
Voted
TASLP
2016
9 years 11 months ago
2016
—We propose a fast speech analysis method which simultaneously performs high-resolution voiced/unvoiced detection (VUD) and accurate estimation of glottal closure and glottal ope...
TASLP
2016
9 years 11 months ago
2016
—Speech separation systems usually operate on the short-time Fourier transform (STFT) of noisy speech, and enhance only the magnitude spectrum while leaving the phase spectrum un...
107
click to vote
TASLP
2016
9 years 11 months ago
2016
—Unseen noise estimation is a key yet challenging step to make a speech enhancement algorithm work in adverse environments. At worst, the only prior knowledge we know about the e...
TASLP
2016
9 years 11 months ago
2016
—We reformulate Joint Factor Analysis so that it can serve as a feature extractor for text-dependent speaker recognition. The new formulation is based on left-to-right modeling w...
119
Voted
TASLP
2016
9 years 11 months ago
2016
Abstract—This paper compares different approaches for using deep neural networks (DNNs) trained to predict senone posteriors for the task of spoken language recognition (SLR). Th...
32
Voted
TALG
2016
9 years 11 months ago
2016
TALG
2016
9 years 11 months ago
2016
We consider the problem of detecting a cycle in a directed graph that grows by arc insertions, and the related problems of maintaining a topological order and the strong components...
TALG
2016
9 years 11 months ago
2016
The restricted max-min fair allocation problem (also known as the restricted Santa Claus problem) is one of few problems that enjoys the intriguing status of having a better estima...
TALG
2016
9 years 11 months ago
2016
We study the well-known Label Cover problem under the additional requirement that problem instances have large girth. We show that if the girth is some k, the problem is roughly 2...