Improved overlap speech diarization of meeting recordings using long-term conversational features
Related publications (36)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Electron traps at the nanostructured TiO2 (anatase)/aq. electrolyte interface were studied by electrochem. methods. The transient current decays at different potentials pos. of the flatband potential clearly illustrate the trap-filling process. The more ne ...
We present a common probabilistic framework for kernel or spline smooth- ing methods, including popular architectures such as Gaussian processes and Support Vector machines. We identify the problem of unnormalized loss func- tions and suggest a general tec ...
Boosting is a general method for training an ensemble of classifiers with a view to improving performance relative to that of a single classifier. While the original AdaBoost algorithm has been defined for classification tasks, the current work examines it ...
We present the resitivity and structural studies of the melt-spun Al-Mn alloys (with 10-18 at% Mn) that contain more than 50 vol% of the quasicrystalline (qX) Al//4Mn phase. The resistivity varies little with temperature up to approximately 600 K where it ...
This paper describes how a speaker verification task can be advantageously decomposed into a series of binary classification problems, i.e. each problem discriminating between two classes only. Each binary classifier is specific to one speaker, one anti-sp ...
This paper describes how a speaker verification task can be advantageously decomposed into a series of binary classification problems, i.e. each problem discriminating between two classes only. Each binary classifier is specific to one speaker, one anti-sp ...
