Reduced complexity likelihood approximation for chaotic trajectory segments
Graph Chatbot
Chat with Graph Search
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 simulation of Phasor Measurement Units (PMUs) into real-time simulators (RTSs) is typically limited by the complexity of the synchrophasor estimation (SE) algorithm. This is especially true when dealing with distribution network PMUs due to the more de ...
When we have to valorise the geological information for land planning or engineering applications, it is difficult to integrate the large complexity of the maps of the Swiss Geological Atlas at the scale of 1:25'000. The heterogeneity of the legends betwee ...
In order to be able to bear the risk they are taking, insurance companies have to set aside a certain amount of cushion that can guarantee the payment of liabilities, up to a dened probability, and thus to remain solvent in case of bad events. This amount ...
We study the case of a three-user broadcast erasure channel with multiple unicast traffic sessions, where feedback from the users is fed back to the transmitter in the form of positive acknowledgment (ACK)/negative acknowledgment (NACK) messages. The capac ...
Institute of Electrical and Electronics Engineers2014
A computation scheme among n parties is fair if no party obtains the computation result unless all other n-1 parties obtain the same result. A fair computation scheme is optimistic if n honest parties can obtain the computation result without resorting to ...
The growing complexity of telemanipulation tasks calls for increased realism and intuitiveness of the interaction between the user and the master control. Humans perceive multiple haptic features of an object such as its stiffness, temperature, and shape, ...
We propose a novel camera pose estimation or perspective-n-point (PnP) algorithm, based on the idea of consistency regions and half-space intersections. Our algorithm has linear time-complexity and a squared reconstruction error that decreases at least qua ...
A universal construction is an algorithm which transforms any sequential implementation of an object into a concurrent implementation of that same object in a linearizable and wait-free manner. Such constructions require underlying low-level universal shar ...
In this paper we present an intuitive tool suitable for 2D artists using touch-enabled pen tablets. An artist-oriented tool should be easy-to-use, real-time, versatile, and locally refinable. Our approach uses an interactive system for 3D character posing ...
Given a system with n>3t+1 processes, where t is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in O(t) expected running time. This improves the O(n2) expected running ...
