Concept

Algebraic expression

Publications associées (126)

Social Learning Over Weakly Connected Graphs

In this paper, we study diffusion social learning over weakly connected graphs. We show that the asymmetric flow of information hinders the learning abilities of certain agents regardless of their local observations. Under some circumstances that we clarif ...

2017

Snow fracture in relation to slab avalanche release: critical state for the onset of crack propagation

Johan Alexandre Philippe Gaume, Nander Wever, Jürg Schweizer, Alec van Herwijnen

The failure of a weak snow layer buried below cohesive slab layers is a necessary, but insufficient, condition for the release of a dry-snow slab avalanche. The size of the crack in the weak layer must also exceed a critical length to propagate across a sl ...

Copernicus GmbH2017

Lightning Location Systems and Interstroke Intervals: Effects of Imperfect Detection Efficiency

Marcos Rubinstein, Mohammad Azadifar, Mirjana Stojilovic

Lightning location systems (LLSs) are often used to obtain parameters of lightning flashes. However, the imperfect detection efficiency (DE) of these systems affects the accuracy of the results. In this paper, we focus on the effects of the imperfect DE on ...

Ieee2016

Exterior Convexity And Classical Calculus Of Variations

Saugata Bandyopadhyay, Swarnendu Sil

We study the relation between various notions of exterior convexity introduced in [S. Bandyopadhyay, B. Dacorogna and S. Sil, J. Eur. Math. Soc. 17 (2015) 1009-1039.] with the classical notions of rank one convexity, quasiconvexity and polyconvexity. To th ...

Edp Sciences S A2016

Locating transient disturbance sources and modelling their interaction with transmission lines

Gaspard Lugrin

This thesis deals with the application of electromagnetic time reversal to locating transient disturbance sources and the use of the asymptotic theory for the modelling of their interaction with transmission lines. We demonstrate that the time-of-arrival, ...

EPFL2016

Diffusion social learning over weakly-connected graphs

Ali H. Sayed, Bicheng Ying

In this paper, we study diffusion social learning over weakly-connected graphs. We show that the asymmetric flow of information hinders the learning abilities of certain agents regardless of their local observations. Under some circumstances that we clarif ...

IEEE2016

Resilience To Contagion In Financial Networks

Léo Hamed Amini

We derive rigorous asymptotic results for the magnitude of contagion in a large counterparty network and give an analytical expression for the asymptotic fraction of defaults, in terms of network characteristics. Our results extend previous studies on cont ...

Wiley-Blackwell2016

Proximal Multitask Learning Over Networks With Sparsity-Inducing Coregularization

Ali H. Sayed, Roula Nassif

In this work, we consider multitask learning problems where clusters of nodes are interested in estimating their own parameter vector. Cooperation among clusters is beneficial when the optimal models of adjacent clusters have a good number of similar entri ...

IEEE2016

Global Optimization on an Interval

Thomas Alois Weber

This paper provides expressions for the largest and smallest solution of a global optimization problem using an adjoint variable which represents the available one-sided improvements up to the interval “horizon”. Interpreting the problem in terms of optima ...

2016

Maximally Localized Radial Profiles for Tight Steerable Wavelet Frames

Michaël Unser, Virginie Sophie Uhlmann, Pedram Pad

A crucial component of steerable wavelets is the radial profile of the generating function in the frequency domain. In this paper, we present an infinite-dimensional optimization scheme that helps us find the optimal profile for a given criterion over the ...

IEEE2016

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