Publication

Decentralized consensus optimization with asynchrony and delays

Publications associées (91)

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

Early Local Decisions in Distributed Agreement

Rachid Guerraoui, Bastian Pochon, Partha Dutta

When devising a distributed agreement algorithm, it is common to minimize the time complexity of global decisions, which is typically measured as the number of communication rounds needed for all correct processes to decide. In practice, what we might want ...

2003

Solving Agreement Problems with Weak Ordering Oracles

André Schiper, David Cavin, Fernando Pedone

Agreement problems, such as consensus, atomic broadcast, and group membership, are central to the implementation of fault-tolerant distributed systems. Despite the diversity of algorithms that have been proposed for solving agreement problems in the past y ...

2002

Reliable and Total Order Broadcast in the Crash-Recovery Model

Rachid Guerraoui, Romain Boichat

This paper addresses the problem of broadcasting messages in a reliable and totally ordered manner when processes and channels may crash and recover, or crash and never recover. We present a suite of specifications of reliable and total order broadcast pri ...

2001

Maintaining minimum spanning forests in dynamic graphs

Monika Henzinger

We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time o(sqrt(n)) per operation. To be precise, the algorithm uses O(n1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. ...

2001

Compensation of Unidirectional Geometric Distortion in EPI Using Spline Warping

Michaël Unser, Philippe Thévenaz

Due to magnetic field inhomogeneities, EPI images are geometrically distorted, predominantly along the phase-encoding direction. Currently, the distortion is either ignored or compensated manually using a warping function defined through a set of landmarks ...

IEEE1999

Soft real-time analysis of asynchronous agreement algorithms using Petri nets

Nicoleta Sergent

A distributed algorithm comprises a collection of sequential-code entities, which are spread over different computers connected to a network. The process of designing a distributed algorithm is influenced by the assumptions we make on the computational env ...

EPFL1998

Unsupervised Connectivity-Based Thresholding Segmentation of Midsagittal Brain MR Images

Michaël Unser

In this paper, we propose an algorithm for automated segmentation of midsagittal brain MR images. First, we apply thresholding to obtain binary images. From the binary images, we locate some landmarks. Based on the landmarks and anatomical information, we ...

Elsevier1998

Two variants of the FxLMS algorithm

Ali H. Sayed

We present a time-domain feedback analysis of the FxLMS algorithm, which has been receiving increasing attention in the literature due to its potential application in the active control of noise. In particular, we introduce a generalized FxLMS variant and ...

1995

Time-variant displacement structure and triangular arrays

Ali H. Sayed

The authors extend the concept of displacement structure to time-variant matrices and use it to efficiently and recursively propagate the Cholesky factor of such matrices. A natural implementation of the algorithm is via a modular triangular array of proce ...

IEEE1994