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 revisit the problem of finding the probability distribution of a fermionic number of one-dimensional spinless free fermions on a segment of a given length. The generating function for this probability distribution can be expressed as a determinant of a ...
A daylighting system for use in a building including a louver array having a first longitudinal element, and a second longitudinal element spaced therefrom. At least one of the first and second elements has an asymmetrical profile, each of the first and se ...
United States Patent and Trademark Office (USPTO)2013
We establish exponential convergence of the hp-version of isogeometric analysis for second order elliptic problems in one spacial dimension. Specifically, we construct, for functions which are piecewise analytic with a finite number of algebraic singularit ...
We investigate the tip region of a power law fluid driven fracture propagating at constant velocity V in an impermeable linear elastic medium with the presence of fluid lag of a priori unknown length. The fracture is loaded by the internal fluid pressure p ...
This thesis is devoted to the understanding of topological graphs. We consider the following four problems: 1. A \emph{simple topological graph} is a graph drawn in the plane so that its edges are represented by continuous arcs with the property that any t ...
Metrics on shape spaces are used to describe deformations that take one shape to another, and to define a distance between shapes. We study a family of metrics on the space of curves, which includes several recently proposed metrics, for which the metrics ...
We consider the homogeneous and the non-homogeneous convex relaxations for combinatorial penalty functions defined on support sets. Our study identifies key differences in the tightness of the resulting relaxations through the notion of the lower combinato ...
A monotone cylindrical graph is a topological graph drawn on an open cylinder with an infinite vertical axis satisfying the condition that every vertical line intersects every edge at most once. It is called simple if any pair of its edges have at most one ...
This paper presents a non-asymptotic upper bound for the estimation error of the constrained lasso, under the high-dimensional (n≪p) setting. In contrast to existing results, the error bound in this paper is sharp, is valid when the parameter to be e ...
We describe Curves+, a new nucleic acid conformational analysis program which is applicable to a wide range of nucleic acid structures, including those with up to four strands and with either canonical or modified bases and backbones. The program is algori ...