We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
Chetan Nanjunda Mathur, Mohamed A. Haleem, Rajarat...
Abstract— The design of LDPC decoders with low complexity, high throughput, and good performance is a critical task. A well-known strategy is to design structured codes such as q...
Yuan-Mao Chang, Andres I. Vila Casado, Mau-Chung F...
Registration errors between the physical world and computergenerated objects are a central problem in Augmented Reality (AR) systems. Some existing AR systems have demonstrated ho...