Publications associées à Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Low Complexity Spectral Analysis of Heart-Rate-Variability through a Wavelet Based FFT

Andreas Peter Burg, Georgios Karakonstantis, Aviinaash Sankaranarayanan

In this paper, a low complexity system for spectral analysis of heart rate variability (HRV) is presented. The main idea of the proposed approach is the implementation of the Fast-Lomb periodogram that is a ubiquitous tool in spectral analysis, using a wav ...

2012

Neutralité et engagement. Les relations entre le Comité international de la Croix-Rouge et le gouvernement suisse pendant la Seconde Guerre mondiale

Isabelle Barbara Marie-Hélène Cardia

Since its creation in 1863, the ICRC has maintained a special relationship with Switzerland and its government, based on the pursuit of neutrality and on the perception of a common destiny. Such a perception and the adherence to shared political values wer ...

Société d'histoire de la Suisse romande2012

Adaptive Models for Gene Networks

Ali H. Sayed

Biological systems are often treated as time-invariant by computational models that use fixed parameter values. In this study, we demonstrate that the behavior of the p53-MDM2 gene network in individual cells can be tracked using adaptive filtering algorit ...

Public Library of Science2012

Rethinking FPGAs: Elude the Flexibility Excess of LUTs with And-Inverter Cones

Paolo Ienne, David Novo Bruna, Hadi Parandeh Afshar, Hind Benbihi

Look-Up Tables (LUTs) are universally used in FPGAs as the elementary logic blocks. They can implement any logic function and thus covering a circuit is a relatively straightforward problem. Naturally, flexibility comes at a price, and increasing the numbe ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2012

COMMENT ON “MIXING BELIEFS AMONG INTERACTING AGENTS”

Jean-Yves Le Boudec, Javier Gomez Serrano

We comment on the derivation of the main equation in the bounded confidence model of opinion dynamics. In the original work, the equation is derived using an ad-hoc counting method. We point that the original derivation does contain some small mistake. The ...

World Scientific Publ Co Pte Ltd2012

How to Allocate Tasks Asynchronously

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Asynchronous task allocation is a fundamental problem in distributed computing, in which p asyn- chronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key bui ...

2012

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

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

The complexity of robust atomic storage

Rachid Guerraoui, Marko Vukolic

We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolerating the largest possible number t of Byzantine storage component failures ( ...

ACM Press2011

On the Construction of Polar Codes

Emre Telatar, Seyed Hamed Hassani, Ramtin Pedarsani

We consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. The complexity of designing polar codes via an exact evaluation of the polarized channels to find which ones are "good" appears to be exponenti ...

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

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Graph Chatbot

Chattez avec Graph Search

Low Complexity Spectral Analysis of Heart-Rate-Variability through a Wavelet Based FFT

Neutralité et engagement. Les relations entre le Comité international de la Croix-Rouge et le gouvernement suisse pendant la Seconde Guerre mondiale

Adaptive Models for Gene Networks

Rethinking FPGAs: Elude the Flexibility Excess of LUTs with And-Inverter Cones

COMMENT ON “MIXING BELIEFS AMONG INTERACTING AGENTS”

How to Allocate Tasks Asynchronously

Generating Fast Indulgent Algorithms

Complexity of the critical node problem over trees

The complexity of robust atomic storage

On the Construction of Polar Codes

Neutralité et engagement. Les relations entre le Comité international de la Croix-Rouge et le gouvernement suisse pendant la Seconde Guerre mondiale

Adaptive Models for Gene Networks

Low Complexity Spectral Analysis of Heart-Rate-Variability through a Wavelet Based FFT

Complexity of the critical node problem over trees

COMMENT ON “MIXING BELIEFS AMONG INTERACTING AGENTS”

How to Allocate Tasks Asynchronously

Generating Fast Indulgent Algorithms

The complexity of robust atomic storage

On the Construction of Polar Codes

Rethinking FPGAs: Elude the Flexibility Excess of LUTs with And-Inverter Cones