Weighted coloring is a generalization of the wellknown vertex (unweighted) coloring for which a number of exact algorithms have been presented in the literature. We are not aware of any optimal method specifically designed for the minimum-weighted coloring problem on arbitrary graphs. Only a few heuristics have been developed with the goal of finding tighter upper bounds for the maximum-weighte...

Communication is transfer of information from source to sink or sender to receiver. The signal when transferred through the noisy channel gets affected by the noise and becomes an error signal when it reaches the receiver. Decoding is the process of retrieving the correct information from the received signal. The weighted bit flipping LDPC decoding algorithm gives a good performance in retrievi...

Removal of random value impulse noise is essential to help successive process like image segmentation, analysis, pattern recognition etc. To remove uniform/randomvalued impulse noise without compromising the image detail information such as sharp edges, Modified Directional Weighted Median Filter (MDWMF) is proposed. The proposed filter utilizes the second order difference (SOD) along with a th...

We explore the large spatial variation in the relationship between population density and burned area, using continental-scale Geographically Weighted Regression (GWR) based on 13 years of satellite-derived burned area maps from the global fire emissions database (GFED) and the human population density from the gridded population of the world (GPW 2005). Significant relationships are observed o...

<span lang="EN-US">It is proved that hard decision algorithms are more appropriate than a soft for low-density parity-check (LDPC) decoding since they less complex at the level. On other hand, it notable algorithm outperforms one in terms of bit error rate (BER) gap. In order to minimize BER and gap between these two families LDPC codes, new suggested this paper, which based on both norma...