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 compute the electric dipole moment of nucleons in the large N-c QCD model by Witten, Sakai, and Sugimoto with N-f = 2 degenerate massive flavors. Baryons in the model are instantonic solitons of an effective five-dimensional action describing the whole ...
Is it possible to detect if the sample paths of a stochastic process almost surely admit a finite expansion with respect to some/any basis? The determination is to be made on the basis of a finite collection of discretely/noisily observed sample paths. We ...
Given a set P of n points in ℝd, let d1 > d2 >...denote all distinct inter-point distances generated by point pairs in P. It was shown by Schur, Martini, Perles, and Kupitz that there is at most oned-dimensional regular simplex of edge length d1 whos ...
Sampling schemes on the sphere require O(L^2) samples to perfectly sample and reconstruct a signal with bandwidth L. If the signal in question is a low-pass observation of a finite collection of spikes or rotations of a known function, we can use less samp ...
Let P be a finite point set in the plane. A \emph{c-ordinary triangle} in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P. Motivated by a question o ...
The present thesis deals with problems arising from discrete mathematics, whose proofs make use of tools from algebraic geometry and topology. The thesis is based on four papers that I have co-authored, three of which have been published in journals, and o ...
We prove a lower bound on the number of ordinary conics determined by a finite point set in R-2. An ordinary conic for S subset of R-2 is a conic that is determined by five points of S and contains no other points of S. Wiseman and Wilson proved the Sylves ...
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 ...
Here we present a method of constructing steerable wavelet frames in L-2(R-d) that generalizes and unifies previous approaches, including Simoncelli's pyramid and Riesz wavelets. The motivation for steerable wavelets is the need to more accurately account ...
Here we present a method of constructing steerable wavelet frames in L2(Rd ) that generalizes and unifies previous approaches, including Simoncelli's pyramid and Riesz wavelets. The motivation for steerable wavelets is the nee ...
