Distributed Signal Processing via Chebyshev Polynomial Approximation
Related publications (37)
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.
We consider a discontinuous Galerkin finite element method for the advection– reaction equation in two space–dimensions. For polynomial approximation spaces of degree greater than or equal to two on triangles we propose a method where stability is obtained ...
Understanding stakeholders’ needs is necessary to design requirements for organizations and IT systems. We present a systemic modeling method to identify and categorize stakeholders within value networks, to analyze the relationships between these value ne ...
We give a convergence estimate for a Petrov-Galerkin Algebraic Multigrid method. In this method, the prolongations are defined using the concept of smoothed aggregation while the restrictions are simple aggregation operators. The analysis is carried out by ...
The paper introduces a cubic-phase-function based method to estimate interference phase in digital holographic interferometry. The proposed method relies on piecewise polynomial approximation of phase by dividing an arbitrary row/column of the complex reco ...
Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees are required. For networks of FIFO aggregate schedulers, the main existing suffic ...
Process Analytical Technology (PAT) has greatly evolved in the last decades due to the development of multivariate online sensors that are able to monitor the properties of industrial processes in real time [1, 2]. The online monitoring of product quality ...
Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is hard to find efficient implementations for priorities; because they express ...
The Uniformization Theorem due to Koebe and Poincaré implies that every compact Riemann surface of genus greater or equal to 2 can be endowed with a metric of constant curvature – 1. On the other hand, a compact Riemann surface is a complex algebraic curve ...
Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees are required. For networks of FIFO aggregate schedulers, the main existing suffic ...
In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods proposed in the literature attack this problem by distributed linear iterative algorithms, wi ...