Publications associées (15)

Hardware and Software Normal Basis Arithmetic for Pairing Based Cryptography in Characteristic Three

Robert Granger, Martijn Stam

Although identity-based cryptography offers a number of functional advantages over conventional public key methods, the computational costs are significantly greater. The dominant part of this cost is the Tate pairing, which, in characteristic three, is be ...
Institute of Electrical and Electronics Engineers2005

Simulation of electrically large structures in EMC studies

Abraham Rubinstein

The aim of this thesis is the study of the simulation of electrically large structures and the application of the results to automotive Electromagnetic Compatibility (EMC). The theoretical and experimental work carried out has led to the development of com ...
EPFL2004

An Algorithm to Compute Bounds for the Star Discrepancy

Eric Thiémard

We propose an algorithm to compute upper and lower bounds for the star discrepancy of an arbitrary sequence of points in the s-dimensional unit cube. The method is based on a particular partition of the unit cube into subintervals and on a specialized proc ...
2001

Optimal volume subintervals with k points and star discrepancy via integer programming

Eric Thiémard

Given n points in the s-dimensional unit cube, we consider the problem of finding a subinterval of minimum or maximum volume that contains exactly k of the n points. We give integer programming formulations of these problems and techniques to tackle their ...
2001

Computing Bounds for the Star Discrepancy

Eric Thiémard

We observe that the time required to compute the star discrepancy of a sequence of points in a multidimensional unit cube is prohibitive and that the best known upper bounds for the star discrepancy of (t,s)-sequences and (t,m,s)-nets are useful only for s ...
2000

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.