Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Multicellular organisms require very well organized and finely balanced cell-cell communication, adhesion and coordination to ensure the organisms homeostasis. These functions rely on specialized receptors placed at the cells membrane whose binding to thei ...
Conductive-type dynamics in complex systems in the framework of Scale Relativity Theory are analyzed. Using the Madeling scenario in the description o f complex system dynamics through continuous and nondifferentiable curves (fractal/multifractal curves), ...
Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...
A series of three formulations were prepared in view of experimental and theoretical investigation of their drug release potential. The morphology of the film formulations, in terms of distribution of drug into the polymeric matrix and the nature of the dr ...
A series of four drug release formulations based on 5-fluorouracil encapsulated into a chitosan-based matrix were prepared by in situ hydrogelation with 3,7-dimethyl-2,6-octadienal. The formulations were investigated from structural and morphological aspec ...
We consider the problem of sampling from a density of the form p(x) ? exp(-f (x) - g(x)), where f : Rd-+ R is a smooth function and g : R-d-+ R is a convex and Lipschitz function. We propose a new algorithm based on the Metropolis-Hastings framework. Under ...
We describe the first gradient methods on Riemannian manifolds to achieve accelerated rates in the non-convex case. Under Lipschitz assumptions on the Riemannian gradient and Hessian of the cost function, these methods find approximate first-order critical ...
We consider the problem of reliably connecting an arbitrarily large set of computers (nodes) with communication channels. Reliability means here the ability, for any two nodes, to remain connected (i.e., their ability to communicate) with probability at le ...
In this article, we establish novel decompositions of Gaussian fields taking values in suitable spaces of generalized functions, and then use these decompositions to prove results about Gaussian multiplicative chaos. We prove two decomposition theorems. Th ...
In this work, we consider multitask learning problems where clusters of nodes are interested in estimating their own parameter vector. Cooperation among clusters is beneficial when the optimal models of adjacent clusters have a good number of similar entri ...
