Concept

Suite d'entiers

Publications associées (24)

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

Generative power of a protein language model trained on multiple sequence alignments

Anne-Florence Raphaëlle Bitbol, Damiano Sgarbossa, Umberto Lupo

Computational models starting from large ensembles of evolutionarily related protein sequences capture a representation of protein families and learn constraints associated to protein structure and function. They thus open the possibility for generating no ...

eLIFE SCIENCES PUBL LTD2023

In-Memory Hardware and Architectural Extensions for Workloads Acceleration

William Andrew Simon

Utilization of edge devices has exploded in the last decade, with such use cases as wearable devices, autonomous driving, and smart homes. As their ubiquity grows, so do expectations of their capabilities. Simultaneously, their formfactor and use cases lim ...

EPFL2022

A Rosetta-based protein design protocol converging to natural sequences

Bruno Emanuel Ferreira De Sousa Correia, Zander Harteveld, Stéphane Rosset, Giulia Sormani

Computational protein design has emerged as a powerful tool capable of identifying sequences compatible with pre-defined protein structures. The sequence design protocols, implemented in the Rosetta suite, have become widely used in the protein engineering ...

AMER INST PHYSICS2021

A short note on inadmissible coefficients of weight 2 and 2k+1 newforms

Malik Amir, Andreas Hatziiliou

Let f(z)=q+∑n≥2a(n)qn be a weight k normalized newform with integer coefficients and trivial residual mod 2 Galois representation. We extend the results of Amir and Hong in Amir and Hong (On L-functions of modular elliptic curves and certain K3 surfaces, R ...

2021

A decomposition of multicorrelation sequences for commuting transformations along primes

Florian Karl Richter

A decomposition of multicorrelation sequences for commuting transformations along primes, Discrete Analysis 2021:4, 27 pp. Szemerédi's theorem asserts that for every positive integer

k

and every

\delta>0

there exists

n

such that every subset of ${1, ...

2021

Slow dynamics in structured neural network models

Samuel Pavio Muscinelli

Humans and some other animals are able to perform tasks that require coordination of movements across multiple temporal scales, ranging from hundreds of milliseconds to several seconds. The fast timescale at which neurons naturally operate, on the order of ...

EPFL2018

Incidences between points and generalized spheres over finite fields and related problems

Van Thang Pham

Let F-q be a finite field of q elements, where q is a large odd prime power and Q = a(1)x(1)(c1) + ..... + a(d)x(d)(cd) is an element of F-q[x(1) ,...,x(d)], where 2

Walter De Gruyter Gmbh2017

Compute-and-Forward: Finding the Best Equation

Michael Christoph Gastpar, Saeid Sahraei

Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optim ...

2014

Algebraic Divisibility Sequences Over Function Fields

Valéry Aurélien Mahé

In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields define ...

Australian Mathematical Society2012

Efficient SIMD Arithmetic Modulo a Mersenne Number

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung

This paper describes carry-less arithmetic operations modulo an integer 2^M-1 in the thousand-bit range, targeted at single instruction multiple data platforms and applications where overall throughput is the main performance criterion. Using an implementa ...

IEEE2011

A decomposition of multicorrelation sequences for commuting transformations along primes

Florian Karl Richter

A decomposition of multicorrelation sequences for commuting transformations along primes, Discrete Analysis 2021:4, 27 pp. Szemerédi's theorem asserts that for every positive integer

k

and every

\delta>0

there exists

n

such that every subset of ${1, ...

2021