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.
We prove that every online learnable class of functions of Littlestone dimension d admits a learning algorithm with finite information complexity. Towards this end, we use the notion of a globally stable algorithm. Generally, the information complexity of ...
Inspired by the work of Lang-Trotter on the densities of primes with fixed Frobenius traces for elliptic curves defined over Q and by the subsequent generalization of Cojocaru-Davis-Silverberg-Stange to generic abelian varieties, we study the analogous que ...
The interior transmission eigenvalue problem is a system of partial differential equations equipped with Cauchy data on the boundary: the transmission conditions. This problem appears in the inverse scattering theory for inhomogeneous media when, for some ...
The J-domain proteins (JDP) form the largest protein family among cellular chaperones. In cooperation with the Hsp70 chaperone system, these co-chaperones orchestrate a plethora of distinct functions, including those that help maintain cellular proteostasi ...
We prove that every Schwartz function in Euclidean space can be completely recovered given only its restrictions and the restrictions of its Fourier transform to all origin-centered spheres whose radii are square roots of integers. In particular, the only ...
We prove that the Cohn-Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn-Triantafillou to the case of odd weight and no ...
We use the theory of foliations to study the relative canonical divisor of a normalized inseparable base-change. Our main technical theorem states that it is linearly equivalent to a divisor with positive integer coefficients divisible by p - 1. We deduce ...
Although W. L. Bragg's law can be easily derived for beginners in the field of crystallography, its interpretation however seems to cause some difficulties which lies essentially in the relation between the concept of lattice planes and the unit cell const ...
In this paper we investigate pointed (q, g, n)-Boltzmann loop-decorated maps with loops traversing only inner triangular faces. Using peeling exploration Budd (2018) modified to this setting we show that its law in the non-generic critical phase can be cod ...
We give a construction of an efficient one-out-of-many proof system, in which a prover shows that he knows the pre-image for one element in a set, based on the hardness of lattice problems. The construction employs the recent zero-knowledge framework of Ly ...