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.
One of the most important tasks of a sensor network (SN) is to detect occurrences of interesting events in the monitored environment. However, data measured by SN is often affected by errors. We investigate the problem of assessing trustworthiness (trust) ...
In this thesis, we study systems of linear and/or non-linear stochastic heat equations and fractional heat equations in spatial dimension 1 driven by space-time white noise. The main topic is the study of hitting probabilities for the solutions to these ...
In this paper, we work on a class of self-interacting nearest neighbor random walks, introduced in [Probab. Theory Related Fields 154 (2012) 149-163], for which there is competition between repulsion of neighboring edges and attraction of next-to-neighbori ...
This paper provides an original framework for the fatigue reliability analysis of a road bridge; the framework is applied to the Venoge bridge, a composite steel concrete bridge within the A1 Swiss highway. Two critical details are selected by inspection: ...
Feature fusion reflects temporal integration. Previous studies mostly employed foveal presentations with no attention manipulation. In this study we examined the effects of sustained spatial attention on temporal integration using feature-fusion with perip ...
Between 1957 and 1960, A. James Speyer served as a Fulbright visiting professor at the National Technical University of Athens (NTUA) in the Faculty of Architecture. The Fulbright program was established to foster mutual understanding across the world, and ...
Studying the complexity of distributed algorithms typically boils down to evaluating how the number of messages exchanged (resp. communication steps performed or shared memory operations executed) by nodes to reliably achieve some common task, evolves with ...
Consider a finite set of sources, each producing independent identically distributed observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources ...
Institute of Electrical and Electronics Engineers2015
An optical rangefinder based on time-of-flight measurement, radiates pulsed light toward an object (70), and receives reflected light from the object, the receiver operating in a photon counting mode, so as to generate a pulse for a detected photon. There ...
Systems and methods for tracking interacting objects may acquire, with a sensor, and two or more images associated with two or more time instances. A processor may generate image data from the two or more images. The processor may apply an extended Probabi ...