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.
The project consists in the study, implementation and comparison of binary matrix multiplication algorithms in C++. We consider Strassen’s algorithm (which is known to perform well over the real numbers) the Four Russians algorithm (which is designed for b ...
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computation. We use quantitative automata (finite automata with transition weights) ...
In this paper we propose an approach to count the number of pedestrians, given a trajectory data set provided by a tracking system. The tracking process itself is treated as a black box providing us the input data. The idea is to apply a hierarchical clust ...
A design procedure for spherical lens antennas is described. A particle swarm optimization (PSO) algorithm is coupled to a mode matching technique based on spherical wave expansion to analyze the lens antennas. The proposed methodology is applied to three ...
This thesis is devoted to the ergodic theory of the piecewise monotone continuous maps of the interval. The coding is a classical approach for these maps. Thanks to the coding, we get a symbolic dynamical system which is almost isomorphic to the initial dy ...
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal value of al ...
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the ma ...
The Building Research & Information special issue ‘Developing Theories of the Built Environment’ (volume 36(3), 2008) explores the epistemology that underpins the creation of theory. It broadens the perspectives that typically escape the cone of vision of ...
The last decades have seen the most important improvements of the safety on the road. But most of the accidents are still coming from the driver when a source of danger is not noticed or when the reaction is not correct during an unusual situation. Two way ...
Recent papers have pointed out that data traffic exhibits self-similarity, but self-similarity is observed only on a finite timescale. In order to account for that, we introduce the concept of pseudo long-range dependencies. In this paper, we describe a Mo ...
