Publications associées (150)

Evolution of superficial lake water temperature profile under diurnal radiative forcing

Ulrich Lemmin, Wolf Hendrik Huwald, Marc Parlange, Ivan Lunati, Nikki Vercauteren

In lentic water bodies, such as lakes, the water temperature near the surface typically increases during the day, and decreases during the night as a consequence of the diurnal radiative forcing (solar and infrared radiation). These temperature variations ...
American Geophysical Union2011

The Complexity Of Early Deciding Set Agreement

Rachid Guerraoui, Bastian Pochon

In the k-set agreement problem, each processor starts with a private input value and eventually decides on an output value. At most k distinct output values may be chosen, and every processor's output value must be one of the proposed values. We consider a ...
Society for Industrial and Applied Mathematics2011

A Parallel Algorithm for Solving Large Convex Minimax Problems

Utkarsh Upadhyay, Ramnik Arora

We consider unconstrained minimax problem where the objective function is the maximum of a finite number of smooth convex functions. We present an iterative method to compute the optimal solution for the unconstrained convex finite minimax problem. The alg ...
Springer2010

Moyennabilité et courbure

Martin Anderegg

As Avez showed (in 1970), the fundamental group of a compact Riemannian manifold of nonpositive sectional curvature has exponential growth if and only if it is not flat. After several generalizations from Gromov, Zimmer, Anderson, Burger and Shroeder, the ...
EPFL2010

Continuity Properties of Law-Invariant (Quasi-)Convex Risk Functions on L∞

Gregor Svindland

We study continuity properties of law-invariant (quasi-)convex functions f : L1(Ω,F, P) to ( ∞,∞] over a non-atomic probability space (Ω,F, P) .This is a supplementary note to [12] ...
Springer Verlag2010

Fast hard thresholding with Nesterov's gradient method

Volkan Cevher, Sina Jafarpour

We provide an algorithmic framework for structured sparse recovery which unifies combinatorial optimization with the non-smooth convex optimization framework by Nesterov [1, 2]. Our algorithm, dubbed Nesterov iterative hard-thresholding (NIHT), is similar ...
2010

Separation and Duality in Locally L0-Convex Modules

Damir Filipovic

Motivated by financial applications, we study convex analysis for modules over the ordered ring L0 of random variables. We establish a module analogue of locally convex vector spaces, namely locally L0-convex modules. In this context, we prove hyperplane s ...
2009

Weak Finsler structures and the Funk weak metric

Marc Troyanov

We discuss general notions of metrics and of Finsler structures which we call weak metrics and weak Finsler structures. Any convex domain carries a canonical weak Finsler structure, which we call its tautological weak Finsler structure. We compute distance ...
Cambridge University Press2009

Harmonic symmetrization of convex sets and of Finsler structures, with applications to Hilbert geometry

Marc Troyanov

David Hilbert discovered in 1895 an important metric that is canonically associated to any convex domain Ω\Omega in the Euclidean (or projective) space. This metric is known to be Finslerian, and the usual proof assumes a certain degree of smoothness of t ...
2009

A hybrid model predictive control scheme for multi-agent containment and distributed sensing

Giancarlo Ferrari Trecate

This paper deals with distributed sensing over a field by means of a multi-agent control architecture. A leader/follower scheme is built up for exploring an environment by properly sensing areas of interest. By means of a control architecture based on dece ...
2009

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.