Concept

Entropy (information theory)

Related publications (378)

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.

An Information-Based Approximation Scheme for Stochastic Optimization Problems in Continuous Time

Daniel Kuhn

Dynamic stochastic optimization problems with a large (possibly infinite) number of decision stages and high-dimensional state vectors are inherently difficult to solve. In fact, scenario tree-based algorithms are unsuitable for problems with many stages, ...

2009

A Novel Criterion for Classifiers Combination in Multistream Speech Recognition

Fabio Valente

In this paper we propose a novel information theoretic criterion for optimizing the linear combination of classifiers in multi stream automatic speech recognition. We discuss an objective function that achieves a trade-off between the minimization of a bou ...

2009

Towards a Comprehensive RVC VTL: A CAL Description of an Efficient AVC Baseline Encoder

Ihab Mostafa Amin Mohamed Amer, Karim Maarouf, Hussein Aman-Allah, Ehab Hanna

The Video Tool Library (VTL) is one of the major normative components of the Reconfigurable Video Coding (RVC) standard. It specifies the set of functional units (FUs)that may be interchangeably combined and connected to form different video codecs, with v ...

2009

On the weakest failure detector ever

Rachid Guerraoui

Many problems in distributed computing are impossible to solve when no information about process failures is available. It is common to ask what information about failures is necessary and sufficient to circumvent some specific impossibility, e. g., consen ...

Springer Verlag2009

CAL Dataflow Components For an MPEG RVC AVC Baseline Encoder

Marco Mattavelli, Ihab Mostafa Amin Mohamed Amer, Karim Maarouf, Hussein Aman-Allah, Ehab Hanna

In this paper, an efficient H.264/AVC baseline encoder, described in RVC-CAL actor language, is introduced. The main aim of the paper is two folds: a) to demonstrate the flexibility and ease that is provided by RVC-CAL, which allows for efficient implement ...

2009

Beamforming with a Maximum Negentropy Criterion

Philip Neil Garner, Weifeng Li

In this paper, we address a beamforming application based on the capture of far-field speech data from a single speaker in a real meeting room. After the position of the speaker is estimated by a speaker tracking system, we construct a subband-domain beamf ...

2009

Differential Distributed Cayley Space-Time Codes

Frédérique Oggier

We consider a wireless relay network with no channel information, which implements differential distributed space-time coding. We propose a coding strategy based on Cayley codes, which yields high data rate codes available for an arbitrary number of relay ...

2009

Lossy Source Coding with Gaussian or Erased Side-Information

Emre Telatar, Suhas Diggavi, Etienne Perron

In this paper we find properties that are shared between two seemingly unrelated lossy source coding setups with side information. The first setup is when the source and side information are jointly Gaussian and the distortion measure is quadratic. The sec ...

2009

Lossy Source Coding with Gaussian or Erased Side-Information

Emre Telatar, Suhas Diggavi, Etienne Perron

In this paper we find properties that are shared between two seemingly unrelated lossy source coding setups with side-information. The first setup is when the source and side-information are jointly Gaussian and the distortion measure is quadratic. The sec ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Another Glance at Double-Length Hashing

Martijn Stam, Onur Özen

We propose a novel framework for blockcipher-based double-length hash functions by extending the recent generalization presented by Stam at FSE '09 for single-call hash functions. We focus on compression functions compressing 3n bits to 2n bits that use on ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009