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.
We prove, in a purely combinatorial way, the spectral curve topological recursion for the problem of enumeration of bi-colored maps, which are dual objects to dessins d'enfant. Furthermore, we give a proof of the quantum spectral curve equation for this pr ...
In this paper, we propose a novel selective search method to speed up the object detection via category-based attention scheme. The proposed attentional searching strategy is designed to focus on a small set of selected regions where the object category is ...
In this paper, convergence and performance properties of a sample-data continuous time model predictive control (MPC) scheme with economic performance index are developed. In particular, we provide sufficient conditions for convergence of the close loop st ...
The perception of ensemble characteristics is often regarded as an antidote to an established bottleneck in focused attention and working memory, both of which appear to be limited in capacity to a few objects only. In order to test the associative law of ...
Kan spectra provide a combinatorial model for the stable homotopy category. They were introduced by Dan Kan in 1963 under the name semisimplicial spectra. A Kan spectrum is similar to a pointed simplicial set, but it has simplices in negative degrees as we ...
In nature, one observes that a K-theory of an object is defined in two steps. First a “structured” category is associated to the object. Second, a K-theory machine is applied to the latter category that produces an infinite loop space. We develop a general ...
Many algorithms have been proposed to solve the problem of matching feature points in two or more images using geometric assumptions to increase the robustness of the matching. However, these assumptions do not always hold; in particular, few methods addre ...
We study the issue of data consistency in distributed systems. Specifically, we consider a distributed system that replicates its data at multiple sites, which is prone to partitions, and which is assumed to be available (in the sense that queries are alwa ...
Trajectories of objects are estimated by determining the optimal solution(s) of a tracking model on the basis of an occupancy probability distribution. The occupancy probability distribution is the probability of presence of objects over a set of discrete ...
The aim of my presentation is to communicate results of an exploratory stage of my research. I will briefly cover the research design, followed by a summary of the understandings of space that I use to structure the presentation. Then I will discuss some r ...