Concept

Générateur de nombres aléatoires matériel

Publications associées (202)

Applications of Derandomization Theory in Coding

Randomized techniques play a fundamental role in theoretical computer science and discrete mathematics, in particular for the design of efficient algorithms and construction of combinatorial objects. The basic goal in derandomization theory is to eliminate ...

EPFL2010

Derandomization and Group Testing

Mahdi Cheraghchi Bashi Astaneh

The rapid development of derandomization theory, which is a fundamental area in theoretical computer science, has recently led to many surprising applications outside its initial intention. We will review some recent such developments related to combinator ...

2010

A Message Recognition Protocol Based on Standard Assumptions

Serge Vaudenay, Atefeh Mashatan

We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the random oracle model or are based on non-standard assumptions. Incorporating ran ...

Springer2010

Resource and Performance Comparisons for Different Acquisition Methods that can be Applied to a VHDL-based GPS Receiver in Standalone and Assisted Cases

Pierre-André Farine, Cyril Botteron, Jérôme Leclère

There are mainly three well-known techniques to acquire a GNSS signal. The first, called Serial Search Acquisition, consist in correlating the Pseudo-Random Noise (PRN) codes for all the codes phases and all the frequency bins. The two others make use of t ...

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

The Single-Electron Bipolar Avalanche Transistor

Marc Lany

We present a new electronic device – the single-electron bipolar avalanche transistor (SEBAT) – which allows for the detection of single charges with a bandwidth typically above 1 GHz, exceeding by far the bandwidth of other room-temperature single-electro ...

EPFL2010

Dynamic analysis of anchored concrete linings of plunge pools loaded by high velocity jet impacts issuing from dam spillways

Anton Schleiss

A theoretical stochastic approach is presented for the structural analysis of plunge pool liners dynamically loaded by the impact of free-falling jets. Such an approach was used as the real behaviour of plunge pool liners is complex, and deterministic meth ...

2010

Rateless Codes for AVC Models

Michael Christoph Gastpar

The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an adversary. Fixed-blocklength coding assumes a worst-case bound on the adversary's capabilities, which leads to pessimistic results. This paper defines a vari ...

2010

Fractional Brownian Vector Fields

Michaël Unser, Pouya Dehghani Tafti

This work puts forward an extended definition of vector fractional Brownian motion (fBm) using a distribution theoretic formulation in the spirit of Gel′fand and Vilenkin's stochastic analysis. We introduce random vector fields that share the statistical i ...

SIAM2010

Fast Randomized Test-and-Set and Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Hagit Albo Attiya, Andrei Giurgiu

Most people believe that renaming is easy: simply choose a name \emph{at random}; if more than one process selects the same name, then try again. We highlight the issues that occur when trying to implement such a scheme and shed new light on the read-write ...

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

Low-dimensional models for dimensionality reduction and signal recovery: A geometric perspective

Volkan Cevher

We compare and contrast from a geometric perspective a number of low-dimensional signal models that support stable information-preserving dimensionality reduction. We consider sparse and compressible signal models for deterministic and random signals, stru ...

2010

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search