Publication

I4U Submission to NIST SRE 2012: a large-scale collaborative effort for noise-robust speaker verification

Publications associées (177)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

I4U Submission to NIST SRE 2012: a large-scale collaborative effort for noise-robust speaker verification

Sébastien Marcel, Laurent El Shafey, Ma Bin, Gang Liu

The submission of I4U, is a joint effort of nine research Institutes and Universities across 4 continents for submitting speaker recognition results to NIST SRE 2012. The joint efforts were started with a brief discussion during the Odyssey 2012 workshop i ...

Idiap2013

Method and apparatus for multiple object tracking with k-shortest paths

Pascal Fua, François Fleuret, Jérôme Berclaz

Trajectories of objects are estimated by determining the optimal solution(s) of a tracking model on the basis of an occupancy probability distribution. The occupancy probability distribution is the probability of presence of objects over a set of discrete ...

2013

Monochromatic empty triangles in two-colored point sets

János Pach

Improving a result of Aichholzer et al., we show that there exists a constant c > 0 satisfying the following condition. Any two-colored set of n points in general position in the plane has at least cn(4/3) triples of the same color such that the triangles ...

Elsevier Science Bv2013

Advantageous State Merging During Symbolic Analysis

George Candea, Johannes Kinder, Volodymyr Kuznetsov, Stefan Bucur

A determination is made regarding whether to merge two symbolic analysis states. A first state corresponds to a first path through a program to a program location and a second state corresponds to a second path through the program to the program location. ...

2013

Chiese provvisorie. Identità sospesa

Chiara Monterumisi

This book is the result of a choral participation (School of Doctorate Studies in Architecture, University of Bologna and Laboratorio “Ricerca Emilia”) in the exhibition entitled “Architetture padane”. It is also the second step of wider investigation focu ...

CLUEB2013

The Visible Perimeter of an Arrangement of Disks

János Pach, Gábor Tardos, Gabriel Nivasch

Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter, the total length of all pieces of their boundaries visible from above. We prove that if the centers of the disks form ...

Springer2013

Launch Hard or Go Home! Predicting the Success of Kickstarter Campaigns

Patrick Thiran, Matthias Grossglauser, Vincent Etter

Crowdfunding websites such as Kickstarter are becoming increasingly popular, allowing project creators to raise hundreds of millions of dollars every year. However, only one out of two Kickstarter campaigns reaches its funding goal and is successful. It is ...

ACM2013

On the evaluation of 3D codecs on multiview autostereoscopic display

Touradj Ebrahimi, Philippe Hanhart

Evaluating the performance of different 3D codecs on multiview autostereoscopic monitor is a tedious process, as it requires the synthesis of a dense set of views. Therefore, it is legitimate to ask if evaluations could be performed on stereoscopic monitor ...

2013

On Polygons Excluding Point Sets

Radoslav Fulek, Balázs Keszegh, Filip Moric

By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that is in general position, and the convex hull of B c ...

Springer Japan2013

Small distances in convex polygons

Filip Moric

Let d(1) < d(2) < ... denote the set of all distances between two vertices of a convex n-gon. We show that the number of pairs of vertices at distance d(2) from one another is at most n + O(1). (C) 2013 Elsevier B.V. All rights reserved. ...

Elsevier Science Bv2013