Concept

Suite aléatoire

Publications associées (31)

Euclid: Improving the efficiency of weak lensing shear bias calibration

Frédéric Courbin, Georges Meylan, Malte Tewes, Yi Wang, Richard Massey, Marcello Farina

To obtain an accurate cosmological inference from upcoming weak lensing surveys such as the one conducted by Euclid, the shear measurement requires calibration using galaxy image simulations. As it typically requires millions of simulated galaxy images and ...

Edp Sciences S A2024

A 3.3-Gb/s SPAD-Based Quantum Random Number Generator

Edoardo Charbon, Pouyan Keshavarzian, Francesco Gramuglia, Mario Stipcevic

Quantum random number generators (QRNGs) are a burgeoning technology used for a variety of applications, including modern security and encryption systems. Typical methods exploit an entropy source combined with an extraction or bit generation circuit in or ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

STREAMING TENSOR TRAIN APPROXIMATION

Daniel Kressner

Tensor trains are a versatile tool to compress and work with high-dimensional data and functions. In this work we introduce the streaming tensor train approximation (STTA), a new class of algorithms for approximating a given tensor ' in the tensor train fo ...

Philadelphia2023

Further Results on Efficient Implementations of Block Cipher Linear Layers

Subhadeep Banik

At the FSE conference of ToSC 2018, Kranz et al. presented their results on shortest linear programs for the linear layers of several well known block ciphers in literature. Shortest linear programs are essentially the minimum number of 2-input xor gates r ...

2021

Gaussian channel transmission of images and audio files using cryptcoding

Vladimir Ilievski

Random codes based on quasigroups (RCBQ) are cryptcodes, i.e. they are error-correcting codes, which provide information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms for these codes are defined elsewhere. Also, the performance of these codes f ...

2019

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Jonathan Mark Scarlett

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a ...

Institute of Electrical and Electronics Engineers2015

Continuum percolation of polydisperse hyperspheres in infinite dimensions

Claudio Grimaldi

We analyze the critical connectivity of systems of penetrable d-dimensional spheres having size distributions in terms of weighed random geometrical graphs, in which vertex coordinates correspond to random positions of the sphere centers, and edges are for ...

Amer Physical Soc2015

Inhomogeneity of charge-density-wave order and quenched disorder in a high-T-c superconductor

Janusz Andrzej Karpinski, Davide Innocenti

It has recently been established that the high-transition-temperature (high-T-c) superconducting state coexists with short-range charge-density-wave order(1-11) and quenched disorder(12,13) arising from dopants and strain(14-17). This complex, multiscale p ...

Nature Publishing Group2015

Efficient Sample Mining for Object Detection

François Fleuret, Olivier Canévet

We propose a novel approach to efficiently select informative samples for large-scale learning. Instead of directly feeding a learning algorithm with a very large amount of samples, as it is usually done to reach state-of-the-art performance, we have devel ...

2014

Sample Distillation for Object Detection and Image Classification

François Fleuret, Olivier Canévet, Leonidas Lefakis

2014

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