Concept

Division par zéro

Publications associées (14)

Silent Bugs Matter: A Study of Compiler-Introduced Security Bugs

Compilers assure that any produced optimized code is semantically equivalent to the original code. However, even "correct" compilers may introduce security bugs as security properties go beyond translation correctness. Security bugs introduced by such corr ...

Berkeley2023

A Fundamental Limit of Distributed Hypothesis Testing Under Memoryless Quantization

Ali H. Sayed, Emre Telatar, Mert Kayaalp, Yunus Inan

We consider a distributed binary hypothesis testing setup where multiple nodes send quantized information to a central processor, which is oblivious to the nodes’ statistics. We study the regime where the type-II error decays exponentially and the type-I e ...

2021

Control and Characterization of the Compactness of Single-Chain Nanoparticles

Francesco Stellacci, Luciano Andres Abriata, Lixia Wei, Suiyang Liao

Polymers when self-cross-linked into single-chain nanoparticles bear some resemblance to folded proteins; yet proteins have clear energy landscapes that determine precisely folded structures, while single-chain polymer nanoparticles (SCNPs) have more undef ...

AMER CHEMICAL SOC2021

20-300 MHz Frequency Generator with-70 dBc Reference Spur for Low Jitter Serial Applications

Catherine Dehollain, Gürkan Yilmaz

This paper presents a frequency synthesizer based on a phase locked loop (PLL) targeting low jitter applications. The frequency generator covers a range wider than a decade, more explicitly from 20 to 300 MHz. Thanks to a 4-stage ring oscillator, it can pr ...

Ieee2016

New Hardness Results for Diophantine Approximation

Friedrich Eisenbrand, Thomas Rothvoss

We revisit simultaneous diophantine approximation, a classical problem from the geometry of numbers which has many applications in algorithms and complexity. The input of the decision version of this problem consists of a rational vector \alpha, an error b ...

Springer2009

On the computational complexity of periodic scheduling

Thomas Rothvoss

In periodic scheduling jobs arrive regularly and have to be executed on one or several machines or processors. An enormous amount of literature has been published on this topic, e.g. the founding work of Liu & Layland [LL73] is among the top cited computer ...

EPFL2009

Study of B̄0→D0π+π- decays

Olivier Schneider, Aurelio Bay, Mingkui Wang, Chao Wang, Tagir Aushev, Lei Zhang, Vladislav Balagura

We report the results of a study of neutral B meson decays to the D0π+π- final state, where the D0 is fully reconstructed. The results are obtained from an event sample containing 388×106 BB̄-meson pairs collected in the Belle experiment at the KEKB e+e- c ...

2007

Circumventing the problem of the scale: discrete choice models with multiplicative error terms

Michel Bierlaire

We propose a multiplicative specification of a discrete choice model that renders choice probabilities independent of the scale of the utility. The scale can thus be random with unspecified distribution. The model mostly outperforms the classical additive ...

2007

Circumventing the problem of the scale: discrete choice models with multiplicative error terms

Michel Bierlaire

2007

Discrete choice models with multiplicative error terms

Michel Bierlaire

2006

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