Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Abstract--This paper presents local spline regression for semisupervised classification. The core idea in our approach is to introduce splines developed in Sobolev space to map the...
This paper addresses the problem of rate distortion analysis in the context of multi-view image coding, where images are predicted via disparity compensation based on depth map. W...
Abstract—Overcoming the inefficiency of non-cooperative outcomes poses an important challenge for network managers in achieving efficient utilization of network resources. This...