Publication

Ergodic Theory Meets Polarization I: A Foundation of Polarization Theory

Related publications (32)

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.

Intrusion Detection System Resiliency to Byzantine Attacks: The Case Study of Wormholes in OLSR

Georgios Theodorakopoulos

In this paper we extend the work presented in [1], [2] by quantifying the effects of in-band wormhole attacks on Intrusion Detection Systems. More specifically, we propose a mathematical framework for obtaining performance bounds of Byzantine attackers and ...

2007

A Graphical Model for Chord Progressions Embedded in a Psychoacoustic Space

Samy Bengio, Jean-François Paiement

Chord progressions are the building blocks from which tonal music is constructed. Inferring chord progressions is thus an essential step towards modeling long term dependencies in music. In this paper, a distributed representation for chords is designed su ...

2005

A Graphical Model for Chord Progressions Embedded in a Psychoacoustic Space

Samy Bengio, Jean-François Paiement

IDIAP Research Institute2005

A Probabilistic Model for Chord Progressions

Samy Bengio, Jean-François Paiement

2005

A Probabilistic Model for Chord Progressions

Samy Bengio, Jean-François Paiement

IDIAP2005

Matrix Implementations

Spyridon Pongas

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 ...

2005

Fault location algorithms for optical networks

Today, there is no doubt that optical networks are the solution to the explosion of Internet traffic that two decades ago we only dreamed about. They offer high capacity with the use of Wavelength Division Multiplexing (WDM) techniques among others. Howeve ...

EPFL2000

Combining Wavelet-domain Hidden Markov Trees with Hidden Markov Models

In this paper, the concept of Wavelet-domain Hidden Markov Trees (WHMT) is introduced to Automatic Speech Recognition. WHMT are a convenient means to model the structure of wavelet feature vectors, as wavelet coefficients can be interpreted as nodes in a b ...

IDIAP1999

How (Un)Fair are the ABR Binary Schemes, Actually?

Jean-Yves Le Boudec, Milan Vojnovic

It is well known that a simple binary feedback rate--based congestion avoidance scheme cannot ensure a fairness goal of the Available Bit Rate (ABR) service, namely, max--min fairness. In this paper we show how the rates are distributed for the network con ...

1999

Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology

Monika Henzinger, Tandy Warnow

We are given a set script T = (T1, T2, . . . , Tk) of rooted binary trees, each Ti leaf-labeled by a subset L[Ti] C (1,2, . . . , n). If T is a tree on (1, 2, . . . , n), we let T|L denote the minimal subtree of T induced by the nodes of L and all their an ...

1999