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.
For time-sensitive networks, as in the context of IEEE TSN and IETF Detnet, cyclic dependencies are associated with certain fundamental properties such as improving availability and decreasing reconfiguration effort. Nevertheless, the existence of cyclic d ...
Several useful variance-reduced stochastic gradient algorithms, such as SVRG, SAGA, Finito, and SAG, have been proposed to minimize empirical risks with linear convergence properties to the exact minimizers. The existing convergence results assume uniform ...
The strong growth condition (SGC) is known to be a sufficient condition for linear convergence of the stochastic gradient method using a constant step-size γ (SGM-CS). In this paper, we provide a necessary condition, for the linear convergence of SGM-CS, t ...
In this work we study, from the numerical point of view, a problem involving one-dimensional thermoelastic mixtures with two different temperatures; that is, when each component of the mixture has its own temperature. The mechanical problem consists of two ...
We present new results concerning the approximation of the total variation, integral(Omega)vertical bar del u vertical bar, of a function u by non-local, non-convex functionals of the form Lambda delta(u) = integral(Omega)integral(Omega)delta phi(vertical ...
Two popular examples of first-order optimization methods over linear spaces are coordinate descent and matching pursuit algorithms, with their randomized variants. While the former targets the optimization by moving along coordinates, the latter considers ...
The MBI (maximum block improvement) method is a greedy approach to solving optimization problems where the decision variables can be grouped into a finite number of blocks. Assuming that optimizing over one block of variables while fixing all others is rel ...
We study the properties of the normal cone to a proximally smooth set. We give a complete characterization of a proximally smooth set through the monotonicity properties of its normal cone in an arbitrary uniformly convex and uniformly smooth Banach space. ...
This paper describes a near full-scale deployable tensegrity footbridge that deploys from both sides and connects at mid-span. Tensegrity structures are pre-stressed structures composed of tension elements (cables) surrounded by compression elements (strut ...
2015
, , ,
We propose a framework for the detection of junctions in images. Although the detection of edges and key points is a well examined and described area, the multiscale detection of junction centers, especially for odd orders, poses a challenge in pattern ana ...