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.
Nanocatalyst-by-design promises to empower the next generation of electrodes for energy devices. However, current numerical methods consider individual and often geometrical closed-shell nanoparticles, neglecting how the coexistence of several and structur ...
Superionic phases of bulk anhydrous salts based on large cluster-like polyhedral (carba)borate anions are generally stable only well above room temperature, rendering them unsuitable as solid-state electrolytes in energy-storage devices that typically oper ...
Learning transformation invariant representations of visual data is an important problem in computer vision. Deep convolutional networks have demonstrated remarkable results for image and video classification tasks. However, they have achieved only limited ...
We consider the problem of trajectory planning in an environment comprised of a set of obstacles with uncertain locations. While previous approaches model the uncertainties with a prescribed Gaussian distribution, we consider the realistic case in which th ...
We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces correspond to the g ...
Existing works for depth estimation and image deblurring in the presence of depth-dependent blur work with the assumption of a multi-layered scene wherein each layer is modeled in the form of a fronto-parallel plane. In this work, we attempt to relax these ...
An abstract topological graph (briefly an AT-graph) is a pair A = (G, X) where G = (V, E) is a graph and X. E2 is a set of pairs of its edges. The AT-graph A is simply realizable if G can be drawn in the plane so that each pair of edges from X crosses exac ...
Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case where no anchor loca ...
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be NP-hard in general ...
Despite the numerous remedies prescribed so far, tip vortex cavitation (TVC) remains a major issue in design and operation of diverse applications. In this paper, we experimentally investigate the effectiveness of winglets in suppressing TVC. An elliptical ...
