Publication

On Hack's law

Publications associées (101)

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

The spectrum of heavy tailed random matrices

Let X-N be an N x N random symmetric matrix with independent equidistributed entries. If the law P of the entries has a finite second moment, it was shown by Wigner [14] that the empirical distribution of the eigenvalues of X-N , once renormalized by root ...

Springer Verlag2008

Optimal Capital and Risk Allocations for Law-and Cash-Invariant Convex Functions

Damir Filipovic, Gregor Svindland

In this paper we provide the complete solution to the existence and characterization problem of optimal capital and risk allocations for not necessarily monotone, law-invariant convex risk measures on the model space Lp, for any p ε [1;∞]. Our main result ...

Springer Verlag2008

Probabilistic base calling of Solexa sequencing data

Felix Naef, Jacques Rougemont, Christian Iseli, Arnaud Amzallag, Ioannis Xenarios

BACKGROUND: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA colonies. The processing and statistical analysis of such high-throughput dat ...

BioMed Central2008

Propriétés fines des trajectoires du mouvement brownien fractionnaire

Driss Baraka

Let X = {X(t); t ∈ RN} be a (N,d) fractional Brownian motion in Rd of index H ∈ (0,1). We study the local time of X for all temporal dimensions N and spatial dimensions d for which local time exist. We obtain two main results : R1. If we denote by Lx(I) th ...

EPFL2008

Reliability of computational science

Fabio Nobile

Today's computers allow us to simulate large, complex physical problems. Many times the mathematical models describing such problems are based on a relatively small amount of available information such as experimental measurements. The question arises whet ...

Wiley-Blackwell2007

Apraxia: a review

Olaf Blanke, Aude Billard, Biljana Petreska von Ritter-Zahony

Praxic functions are frequently altered following brain lesion, giving rise to apraxia - a complex pattern of impairments that is difficult to assess or interpret. In this chapter, we review the current taxonomies of apraxia and related cognitive and neuro ...

Elsevier2007

A tutorial on (Bayesian) probability

Claudio Mattiussi

The aim of this tutorial is to show that, when properly formulated, probability theory is simply the science of plausible reasoning, which permits us to represent exactly and to update our state of information about the world. This is nothing new, since in ...

2005

Correlation between modulation and structural disorder in the 4,4 '-diethoxyazoxybenzene

Gervais Chapuis, Philip Pattison

The structural refinement of the modulated phase of 4,4'-Diethoxyazoxybenzene (DXB) indicates a correlation between the shifts on the DXB molecule (modulation) and the probability to find the azoxy (N --> O) group in different configurations (disorder). Th ...

2004

Gracefully Degrading Fair Exchange with Security Modules

Rachid Guerraoui, Gildas Avoine

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a tamper proof security module. The security modules trust each other but can only commun ...

2004

GA optimization of terminal antennas by the estimation of the population density of probability using dependency trees

Anja Skrivervik, Francisco Jesus Nunez

An application to antenna optimization of bayesian network density of probability estimators is presented. This technique is very usefull for optimizations where abig number of parameters, multiple solutions and local minima increase the likelihood to conv ...

2004