Reduced complexity likelihood approximation for chaotic trajectory segments
Related publications (123)
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.
We discuss a method to extract independent dynamical systems underlying a single or multiple channels of observation. In particular, we search for one dimensional subsignals to aid the interpretability of the decomposition. The method uses an approximate B ...
We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fix ...
We discuss a method to extract independent dynamical systems underlying a single or multiple channels of observation. In particular, we search for one dimensional subsignals to aid the interpretability of the decomposition. The method uses an approximate B ...
In this paper, we address the design of any number of balanced multiple descriptions using the multiple description scalar quantization(MDSQ) technique. The proposed scheme has the advantages of low complexity, the possibility of being extended easily to a ...
The increasing complexity of nowadays applications has lead to the need of more and more intensive specification and validation tasks by means of software implementations. Besides, as the complexity grows, it is becoming very hard to understand the specifi ...
This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchronous robust implementations where a writer and a set of reader processes (cl ...
We propose a novel detection method for non-coherent synchronization (signal acquisition) in multi-access UWB impulse radio (IR) networks. It is designed to solve the IUI (Inter-User Interference) that occurs in some ad-hoc networks where concurrent transm ...
In this paper, an approach based on ergodic properties for classifying sequences is given. It is particularly robust due to the open loop structure of the detector. Unlike previous works in this direction, such as those concerning the inverse system approa ...
For collective communications, the upper limit of a network's capacity is its liquid throughput. The liquid throughput corresponds to the flow of a liquid in an equivalent network of pipes. However, in communication networks, the aggregate throughput of a ...
This article first reviews recently proposed techniques for adaptive and direct linear MIMO equalization in the context of MIMO-CDMA systems and in particular with application to a MIMO-extended UMTS-FDD downlink. The focus is thereby mainly on the complex ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2003