Publications related to Dictionary learning over large distributed models via dual-ADMM strategies

Online Auctions for Dynamic Assignment: Theory and Empirical Evaluation

Dynamic resource assignment is a common problem in multi-agent systems. We consider scenarios in which dynamic agents have preferences about assignments and the resources that can be assigned using online auctions. We study the trade-off between the follow ...

Ios Press2016

Distributed Policy Evaluation Under Multiple Behavior Strategies

Ali H. Sayed

We apply diffusion strategies to develop a fully-distributed cooperative reinforcement learning algorithm in which agents in a network communicate only with their immediate neighbors to improve predictions about their environment. The algorithm can also be ...

IEEE2015

Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity

Cheng Wang

Given a system with

n > 3t + 1

processes, where

t

is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in

O(t)

expected running time. This improves the

O(n^2)

expected running ...

2015

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Georgios Karakonstantis

Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest. While they are provably capacity achieving over various channels, they have seen limited practical applications. Unfortunately, the successiv ...

2014

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Georgios Karakonstantis

Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest. While they are provably capacity achieving over various channels, they have seen limited practical applications. Unfortunately, the successiv ...

Ieee2014

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Boi Faltings, Immanuel Trummer

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A s ...

Institute of Electrical and Electronics Engineers2014

Optimal design of observable multi-agent networks: A structural system approach

Colin Neil Jones, Francisco Fernandes Castro Rego

This paper introduces a method to design observable directed multi-agent networks, that are: 1) either minimal with respect to a communications-related cost function, or 2) idem, under possible failure of direct communication between two agents. An observa ...

2014

Optimal Design of Observable Multi-Agent Networks: A Structural System Approach

Colin Neil Jones, Francisco Fernandes Castro Rego

This paper introduces a method to design observable directed multi-agent networks, that are: 1) either minimal with respect to a communications-related cost function, or 2) idem, under possible failure of direct communication between two agents. An observa ...

IEEE2014

FETI-DP Domain Decomposition Method

Christoph Jäggli

FETI-DP is a dual iterative, nonoverlapping domain decomposition method. By a Schur complement procedure, the solution of a boundary value problem is reduced to solving a symmetric and positive definite dual problem in which the variables are directly rela ...

2014

Blind Phase Calibration in Sparse Recovery

Rémi Gribonval, Gilles Puy

We consider a blind calibration problem in a compressed sensing measurement system in which each sensor introduces an unknown phase shift to be determined. We show that this problem can be approached similarly to the problem of phase retrieval from quadrat ...

2013

Dictionary learning over large distributed models via dual-ADMM strategies

Graph Chatbot

Chat with Graph Search

Online Auctions for Dynamic Assignment: Theory and Empirical Evaluation

Distributed Policy Evaluation Under Multiple Behavior Strategies

Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Optimal design of observable multi-agent networks: A structural system approach

Optimal Design of Observable Multi-Agent Networks: A Structural System Approach

FETI-DP Domain Decomposition Method

Blind Phase Calibration in Sparse Recovery

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Optimal design of observable multi-agent networks: A structural system approach

Online Auctions for Dynamic Assignment: Theory and Empirical Evaluation

Distributed Policy Evaluation Under Multiple Behavior Strategies

Optimal Design of Observable Multi-Agent Networks: A Structural System Approach

FETI-DP Domain Decomposition Method

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Blind Phase Calibration in Sparse Recovery

Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity