Publication

Distributed Design for Decentralized Control using Chordal Decomposition and ADMM

Publications associées (85)

Reduced Basis Methods for the Solution of Parametrized PDEs in Repetitive and Complex Networks with Application to CFD

The objective of this work is to develop a numerical framework to perform rapid and reliable simulations for solving parametric problems in domains represented by networks and to extend the classical reduced basis method. Aimed at this scope, we propose tw ...

EPFL2012

Structural Analysis of Network Traffic Matrix via Relaxed Principal Component Pursuit

Xiaowen Dong, Zhe Wang, Ke Xu

The network traffic matrix is widely used in network operation and management. It is of crucial importance to analyze the composition and the structure of the network traffic matrix, for which some mathematical approaches such as Principal Component Analys ...

2012

A reduced basis hybrid method for the coupling of parametrized domains represented by fluidic networks

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

In this paper we propose a reduced basis hybrid method (RBHM) for the approximation of partial differential equations in domains represented by complex networks where topological features are recurrent. The RBHM is applied to Stokes equations in domains wh ...

Elsevier2012

Bearing estimation via spatial sparsity using compressive sensing

Volkan Cevher

Bearing estimation algorithms obtain only a small number of direction of arrivals (DOAs) within the entire angle domain, when the sources are spatially sparse. Hence, we propose a method to specifically exploit this spatial sparsity property. The method us ...

Institute of Electrical and Electronics Engineers2012

Compressed Sensing of Simultaneous Low-Rank and Joint-Sparse Matrices

Pierre Vandergheynst, Mohammad Golbabaee

In this paper we consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is generic enough to ...

Institute of Electrical and Electronics Engineers2012

Matrix ALPS: Accelerated Low Rank and Sparse Matrix Reconstruction

Volkan Cevher, Anastasios Kyrillidis

We propose Matrix ALPS for recovering a sparse plus low-rank decomposition of a matrix given its corrupted and incomplete linear measurements. Our approach is a first-order projected gradient method over non-convex sets, and it exploits a well-known memory ...

IEEE2012

A two-level time step technique for the partitioned solution of one-dimensional arterial networks

Simone Deparis, Adelmo Cristiano Innocenza Malossi

In this work a numerical strategy to address the solution of the blood flow in one-dimensional arterial networks through a topology-based decomposition is presented. Such decomposition results in the local analysis of the blood flow in simple arterial segm ...

Elsevier2012

Compressed Sensing of Simultaneous Low-Rank and Joint-Sparse Matrices

Pierre Vandergheynst, Mohammad Golbabaee

In this paper we consider recovery of a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model which can efficiently restricts the degrees of freedom of data and, at the same time, is generic so that f ...

2012

Unsupervised algorithms for distributed estimation over adaptive networks

Ali H. Sayed

This work shows how to develop distributed versions of block blind estimation techniques that have been proposed before for batch processing. Using diffusion adaptation techniques, data are accumulated at the nodes to form estimates of the auto-correlation ...

IEEE2012

Contactless deflection sensing of concave and convex shapes assisted by soft mirrors

Dario Floreano, Ramon Pericet Camara, Michal Karol Dobrzynski, Ionut Halasz

Typical deflection sensors like strain gauges or devices based on optical fibers require physical contact with the deflected substrate during the measurement process. Such contact, however, impacts on the softness of the substrate and may falsify the measu ...

2012

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