Concept

Nombre transcendant

Publications associées (31)

Differentially Private Release of Synthetic Graphs

We propose a (epsilon, delta)-differentially private mechanism that, given an input graph G with n vertices and m edges, in polynomial time generates a synthetic graph G' approximating all cuts of the input graph up to an additive error of O (root mn/epsil ...

ASSOC COMPUTING MACHINERY2020

The perceptual relevance of balance, evenness, and entropy in musical rhythms

Steffen Alexander Herff

There is an uncountable number of different ways of characterizing almost any given real-world stimulus. This necessitates finding stimulus features that are perceptually relevant - that is, they have distinct and independent effects on the perception and ...

ELSEVIER2020

Dependence of the L-Mode scrape-off layer power fall-off length on the upper triangularity in TCV

Stefano Coda, Holger Reimerdes, Benoît Labit, Christian Gabriel Theiler, Antoine Pierre Emmanuel Alexis Merle, Roberto Maurizio, Bernhard Sieglin

This paper reports on experimental observations on TCV with a scan in upper triangularity

{\delta }_{\mathrm{up}}

, including negative triangularity, focusing on the power fall-off length

{\lambda }_{{\rm{q}}}

in L-Mode. The upper triangularity is scann ...

2018

Round Compression for Parallel Matching Algorithms

Slobodan Mitrovic, Aleksander Madry

For over a decade now we have been witnessing the success of massive parallel computation (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the reasons for their success is the fact that these frameworks are able to accurately capture th ...

ASSOC COMPUTING MACHINERY2018

The Particle-In-Fourier (PIF) Approach Applied to Gyrokinetic Simulations

Laurent Villard, Stephan Brunner, Emmanuel Lanti, Noé Thomas Elie Ohana, Claudio Gheller, Aaron Lewis Scheinberg

A widespread method for gyrokinetic simulations relies on the discretization of distribution functions with numerical markers. The electromagnetic field is typically represented on a grid by finite differences or finite elements (Particle-In-Cell, PIC). Wh ...

2017

Visualization, Adaptation, and Transformation of Procedural Grammars

Stefan Lienhard

Procedural shape grammars are powerful tools for the automatic generation of highly detailed 3D content from a set of descriptive rules. It is easy to encode variations in stochastic and parametric grammars, and an uncountable number of models can be gener ...

EPFL2017

Towards the measurement of photon polarisation in the decay B⁺ → K⁺ π⁻ π⁺ γ

This thesis presents a study of the flavour-changing neutral-current radiative B+ to K+pi-pi+gamma decay performed using 3 fb-1 of data collected with the LHCb detector in proton-proton collisions at 7 and 8 TeV centre-of-mass energies. The study of radiat ...

EPFL2016

Sound Compilation of Reals

Viktor Kuncak, Eva Darulova

Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, including finite numerical precision of implementations. We present a programming model where the user writes a program in a real-valued implementation and sp ...

ACM2014

Visual crowding illustrates the inadequacy of local vs. global and feedforward vs. feedback distinctions in modeling visual perception

Michael Herzog, Gregory Francis, Aaron Michael Clarke

Experimentalists tend to classify models of visual perception as being either local or global, and involving either feedforward or feedback processing. We argue that these distinctions are not as helpful as they might appear, and we illustrate these issues ...

Frontiers Research Foundation2014

Fixed Point Property For Universal Lattice On Schatten Classes

Masato Mimura

The special linear group G = SLn(Z[x(1), ... , x(k)]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, and p be any real number in (1, infinity). The main result is the following: any finite index subgroup of G has the fixe ...

Amer Mathematical Soc2013

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