Concept

Corps fini

Publications associées (322)

Wave propagation in periodic buckled beams. Part II: Experiments

Alessandro Spadoni, Florian Paul Robert Maurin

Buckled periodic beams possess a geometrically nonlinear, load-deformation relation and intrinsic length scales such that stable, nonlinear waves are possible. In part I of this paper, a model has been derived that predict compressive/rarefaction, superson ...

Elsevier Science Bv2016

Motivic Classes of Nakajima Quiver Varieties

Dimitri Stelio Wyss

We prove that Hausel’s formula for the number of rational points of a Nakajima quiver variety over a finite field also holds in a suitable localization of the Grothendieck ring of varieties. In order to generalize the arithmetic harmonic analysis in his pr ...

2016

Distributed computation of generalized Nash equilibria in quadratic aggregative games with affine coupling constraints

Maryam Kamgarpour, John Lygeros

We analyse deterministic aggregative games, with large but finite number of players, that are subject to both local and coupling constraints. Firstly, we derive sufficient conditions for the existence of a generalized Nash equilibrium, by using the theory ...

IEEE2016

A posteriori error estimations for elliptic partial differential equations with small uncertainties

Fabio Nobile, Marco Picasso, Diane Sylvie Guignard

In this article, a finite element error analysis is performed on a class of linear and nonlinear elliptic problems with small uncertain input. Using a perturbation approach, the exact (random) solution is expanded up to a certain order with respect to a pa ...

2016

Computational Aspects of Jacobians of Hyperelliptic Curves

Alina Dudeanu

Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...

EPFL2016

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Robert Granger, Philipp Svetolik Jovanovic

A popular approach to tweakable blockcipher design is via masking, where a certain primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute tweak-dependent mask. In this work, we revisit the principle of masking. We do so a ...

Springer Int Publishing Ag2016

Reduced basis method and domain decomposition for elliptic problems in networks and complex parametrized geometries

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

The aim of this work is to solve parametrized partial differential equations in computational domains represented by networks of repetitive geometries by combining reduced basis and domain decomposition techniques. The main idea behind this approach is to ...

Elsevier2016

MATHICSE Technical Report : Multilevel tensor approximation of PDEs with random data

Daniel Kressner, Jonas Ballani, Michael Dieter Peters

In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of random diffusion problems. Using a standard stochastic collocation scheme, we first approximate the infinite dimensional random problem by a deterministic parame ...

MATHICSE2016

Separation with restricted families of sets

János Pach, Gábor Tardos, Márton Naszódi, Zsolt Langi

Given a finite n-element set X, a family of subsets F subset of 2(X) is said to separate X if any two elements of X are separated by at least one member of F. It is shown that if vertical bar F vertical bar > 2(n-1), then one can select vertical bar log n ...

Academic Press Inc Elsevier Science2016

Approximate Decoding for Network Coded Inter-dependent Data

Pascal Frossard, Nikolaos Thomos, Hyung Gon Park

In this paper, we consider decoding of loss tolerant data encoded by network coding and transmitted over error-prone networks. Intermediate network nodes typically perform the random linear network coding in a Galois field and a Gaussian elimination is use ...

Elsevier Science Bv2016

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