Publication

Distributed Pareto Optimization via Diffusion Strategies

Related publications (65)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

RRB-Trees: Efficient Immutable Vectors

Tiark Rompf

Immutable vectors are a convenient data structure for functional programming and part of the standard library of modern languages like Clojure and Scala. The common implementation is based on wide trees with a fixed number of children per node, which allow ...

2011

Enabling parametric feasibility analysis in real-time calculus driven performance evaluation

Alena Simalatsar

This paper advocates a rigorously formal and compositional style for obtaining key performance and/or interface metrics of systems with real-time constraints. We propose a hierarchical approach that couples the independent and different by nature framework ...

ACM2011

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

Martin Vetterli, Yue Lu, Mina Karzand

Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a well-known and influential demosaicking algorithm based on alternating projections (AP), proposed by Gunturk, Altunbasak and Mersereau in 2002. Since its p ...

Institute of Electrical and Electronics Engineers2010

The Stationary Behaviour of Fluid Limits of Reversible Processes is Concentrated on Stationary Points

Jean-Yves Le Boudec

Assume that a stochastic processes can be approximated, when some scale parameter gets large, by a fluid limit (also called mean field limit", or hydrodynamic limit"). A common practice, often called the ``fixed point approximation" consists in approxi ...

arxiv.org2010

A union of incoherent spaces model for classification

Pierre Vandergheynst, Karin Schnass

We present a new and computationally efficient scheme for classifying signals into a fixed number of known classes. We model classes as subspaces in which the corresponding data is well represented by a dictionary of features. In order to ensure low miscla ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Fast Space-Variant Elliptical Filtering Using Box Splines

Michaël Unser, Kunal Narayan Chaudhury

The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is possible to filter an image with a Gaussian-like elliptic window of varying siz ...

IEEE2010

The Subconvexity Problem For Gl(2)

Philippe Michel

Generalizing and unifying prior results, we solve the subconvexity problem for the L-functions of GL(1) and GL(2) automorphic representations over a fixed number field, uniformly in all aspects. A novel feature of the present method is the softness of our ...

Springer-Verlag2010

Particle Swarm Optimization of Memory usage in Embedded Systems

David Atienza Alonso, José Luis Risco Martin

In this paper, we propose a dynamic, non-dominated sorting, multi-objective particle-swarm-based optimizer, named Hierarchical Non-dominated Sorting Particle Swarm Optimizer (H-NSPSO), for memory usage optimization in embedded systems. It significantly red ...

2009

Investigation of 3D moisture diffusion coefficients and damage in a pultruded E-glass/polyester structural composite

Thomas Keller, Florian Riebel

As civil engineers seek to improve buildings and bridges, they are turning to composite materials for some structural components. Thus the long-term life of these materials in damp highly acidic conditions (from concrete pore solutions) is critical. This a ...

2009

Achieving Linear Scaling with Interference Alignment

Ayfer Özgür Aydin

Recent results have shown that interference alignment can achieve K/2 degrees of freedom in a K-user interference channel with time or frequency varying channel coefficients. For fixed number of users K, the number of degrees of freedom characterizes the a ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009