Search results
Enter terms
832 results found.
Section: Publications & Resources
IEEE SPS has built a streamlined mechanism for employers to add a job announcement by simply filling in a simple job opportunity submission Web form related to a particular TC field. To submit job announcements for a particular Technical Committee, the submission form can be found by visiting the page below and selecting a particular TC.
Section: Publications & Resources
IEEE SPS has built a streamlined mechanism for employers to add a job announcement by simply filling in a simple job opportunity submission Web form related to a particular TC field. To submit job announcements for a particular Technical Committee, the submission form can be found by visiting the page below and selecting a particular TC.
Section: Publications & Resources
IEEE SPS has built a streamlined mechanism for employers to add a job announcement by simply filling in a simple job opportunity submission Web form related to a particular TC field. To submit job announcements for a particular Technical Committee, the submission form can be found by visiting the page below and selecting a particular TC.
Section: Publications & Resources
IEEE SPS has built a streamlined mechanism for employers to add a job announcement by simply filling in a simple job opportunity submission Web form related to a particular TC field. To submit job announcements for a particular Technical Committee, the submission form can be found by visiting the page below and selecting a particular TC.
Section: Publications & Resources
IEEE SPS has built a streamlined mechanism for employers to add a job announcement by simply filling in a simple job opportunity submission Web form related to a particular TC field. To submit job announcements for a particular Technical Committee, the submission form can be found by visiting the page below and selecting a particular TC.
Section: Publications & Resources
We introduce graph wedgelets - a tool for data compression on graphs based on the representation of signals by piecewise constant functions on adaptively generated binary graph partitionings. The adaptivity of the partitionings, a key ingredient to obtain sparse representations of a graph signal, is realized in terms of recursive wedge splits adapted to the signal. For this, we transfer adaptive partitioning and compression techniques known for 2D images to general graph structures and develop discrete variants of continuous wedgelets and binary space partitionings.
Section: Publications & Resources
The smoothness of graph signals has found desirable real applications for processing irregular (graph-based) signals. When the latent sources of the mixtures provided to us as observations are smooth graph signals, it is more efficient to use graph signal smoothness terms along with the classic independence criteria in Blind Source Separation (BSS) approaches. In the case of underlying graphs being known, Graph Signal Processing (GSP) provides valuable tools; however, in many real applications, these graphs can not be well-defined a priori and need to be learned from data.
Section: Publications & Resources
In this paper, we investigate the performance of a wide area network (WAN) with three hops over a mixed radio frequency (RF), reconfigurable intelligent surface (RIS) assisted RF and Free space optics (FSO) channel. Here RIS and decode-and-forward (DF) relays are used to improve the coverage and system performance. For general applicability, the RF and FSO links are modelled with Saleh-Valenzuela (S-V) and Gamma-Gamma distribution, respectively.
Section: Publications & Resources
This paper focuses on the constrained optimization problem where the objective function is composed of smooth (possibly nonconvex) and nonsmooth parts. The proposed algorithm integrates the successive convex approximation (SCA) technique with the gradient tracking mechanism that aims at achieving a linear convergence rate and employing the momentum term to regulate update directions in each time instant.
Section: Publications & Resources
This paper examines the problem of bipartite consensus for Takagi-Sugeno fuzzy multi-agent systems subject to uncertainties. The principal intention of this work is to develop a non-fragile controller through which the considered multi-agent system can achieve bipartite consensus. An undirected signed graph is considered to describe the cooperative and competitive interaction among neighboring agents.
