Distributed Design for Decentralized Control using Chordal Decomposition and ADMM
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.
Rationalization and construction-aware design dominate the issue of realizability of freeform architecture. The former means the decomposition of an intended shape into parts which are sufficiently simple and efficient to manufacture; the latter refers to ...
We show that for any open convex polygon P, there is a constant k(P) such that any k(P)-fold covering of the plane with translates of P can be decomposed into two coverings. ...
We consider the assignment of gates to arriving and departing flights at a large hub airport. It is considered to be a highly complex problem even in planning stage when all flight arrivals and departures are assumed to be known precisely in advance. There ...
Consider the problem of signal detection via multiple distributed noisy sensors. We study a linear decision fusion rule of [Z. Quan, S. Cui, and A. H. Sayed, ¿Optimal Linear Cooperation for Spectrum Sensing in Cognitive Radio Networks,¿ IEEE J. Sel. Topics ...
In this study, we address the problem of computing efficiently a dense optical flow between two images under a total variation (TV) regularization and an L1 norm data fidelity constraint using a variational method. We build upon Nesterov's framework for ...
This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via ℓ1-minimisation. The problem can also be seen as factorising a \ddim×\nsig matrix $Y=(y_1 \ldots y_\nsig), , y_n\in \R^\ ...
Institute of Electrical and Electronics Engineers2010
It is an old problem of Danzer and Rogers to decide whether it is possible to arrange 0(1/epsilon) points in the unit square so that every rectangle of area epsilon > 0 within the unit square contains at least one of them. We show that the answer to this q ...
We propose a universal and efficient compressive sampling strategy based on the use of a spread spectrum technique. The method essentially consists in a random pre-modulation of the signal of interest followed by projections onto randomly selected vectors ...
This paper investigates the particular problem of matrices appearing during the modeling of Integrated Circuits with Finite Integration Technique (FIT) method. We present the key points of FIT approach followed by an illustration of the structure and the p ...
We provide an algorithmic framework for structured sparse recovery which unifies combinatorial optimization with the non-smooth convex optimization framework by Nesterov [1, 2]. Our algorithm, dubbed Nesterov iterative hard-thresholding (NIHT), is similar ...
