Publication

Smoothing Alternating Direction Methods for Fully Nonsmooth Constrained Convex Optimization

Publications associées (32)

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

Randomized versus Deterministic Implementations of Concurrent Data Structures

Dan Alistarh

One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...

EPFL2012

Wavelet Shrinkage With Consistent Cycle Spinning Generalizes Total Variation Denoising

Michaël Unser, Emrah Bostan, Ulugbek Kamilov

We introduce a new wavelet-based method for the implementation of Total-Variation-type denoising. The data term is least-squares, while the regularization term is gradient-based. The particularity of our method is to exploit a link between the discrete gra ...

IEEE2012

Adaptive processing over distributed networks

Ali H. Sayed

The article describes recent adaptive estimation algorithms over distributed networks. The algorithms rely on local collaborations and exploit the space-time structure of the data. Each node is allowed to communicate with its neighbors in order to exploit ...

The Institute of Electronics, Information and Communication Engineers2007

Adaptive estimation algorithms over distributed networks

Ali H. Sayed

We provide an overview of adaptive estimation algorithms over distributed networks. The algorithms rely on local collaborations and exploit the space-time structure of the data. Each node is allowed to communicate with its neighbors in order to exploit th ...

2006

Range queries in trie-structured overlays

Karl Aberer, Manfred Hauswirth, Anwitaman Datta, Roman Schmidt, Renault John Lecoultre

Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of query results have been identified as some of the most relevant issues. This ...

2005

An efficient algorithm for real-time estimation and prediction of dynamic OD table

Michel Bierlaire, Frank Crittin

The problem of estimating and predicting Origin-Destination (OD) tables is known to be important and difficult. In the specific context of Intelligent Transportation Systems (ITS), the dynamic nature of the problem and the real-time requirements make it ev ...

2004

New algorithmic methods for real-time transportation problems

Frank Crittin

Two of the most basic problems encountered in numerical optimization are least-squares problems and systems of nonlinear equations. The use of more and more complex simulation tools on high performance computers requires solving problems involving an incre ...

EPFL2004

Improved wireless location accuracy using antenna arrays and interference cancellation

Ali H. Sayed

Location finding for CDMA subscribers using an antenna array at the base station is studied. Two methods are considered for radio location that are based on time of arrival (TOA) and angle of arrival (AOA) measurements. For TOA estimates, a maximum likelih ...

2003

Nondyadic and nonlinear multiresolution image approximations

Maria Arrate Munoz Barrutia

This thesis focuses on the development of novel multiresolution image approximations. Specifically, we present two kinds of generalization of multiresolution techniques: image reduction for arbitrary scales, and nonlinear approximations using other metrics ...

EPFL2002

Animated heads from ordinary images: a least-squares approach

Pascal Fua

We show that we can effectively fit arbitrarily complex animation models to noisy data extracted from ordinary face images. Our approach is based on least-squares adjustment, using of a set of progressively finer control triangulations and takes advantage ...

Elsevier1999