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.
I4U is a joint entry of nine research Institutes and Universities across 4 continents to NIST SRE 2012. It started with a brief discussion during the Odyssey 2012 workshop in Singapore. An online discussion group was soon set up, providing a discussion pla ...
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 ...
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 ...
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 ...
We discuss a model predictive control approach to trajectory tracking problems of constrained nonlinear con- tinuous time systems, where the reference trajectory is a priori known and asymptotically constant. The proposed NMPC scheme is able to explicitly ...
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. ...
A class of nonlinear systems and a filtration of the corresponding codistributions are presented. The filtration enjoys some strong integrability property which allows an easy computation of a linearizing normal form whenever the algorithm terminates with ...
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 ...
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functional lists. We first show how to decide in NP the satisfiability problem for lo ...
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the members of C is at most O(kn), and that this bound cannot be improved. If we only ...
