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.
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 ...
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 ...
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. ...
In a seminal paper published in 1946, Erd ̋os initiated the investigation of the distribution of distances generated by point sets in metric spaces. In spite of some spectacular par- tial successes and persistent attacks by generations of mathe- maticians, ...
Abstract: A simplicial complex C on a d-dimensional configuration of n points is k-regular if its faces are projected from the boundary complex of a polytope with dimension at most d+k. Since C is obviously (n-d-1)-regular, the set of all integers k for wh ...
Let {X(t), t is an element of R-N} be a fractional Brownian motion in R-d of index H. If L(0,I) is the local time of X at 0 on the interval I subset of R-N, then there exists a positive finite constant c(=c(N,d,H)) such that ...
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 ...
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 ...
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 ...
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. ...
