The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
Abstract. The task of verifying the compatibility between interacting web services has traditionally been limited to checking the compatibility of the interaction protocol in terms...
The aim of this study is to show the importance of two classification techniques, viz. decision tree and clustering, in prediction of learning disabilities (LD) of school-age chil...
In Ciphertext Policy Attribute based Encryption scheme, the encryptor can fix the policy, who can decrypt the encrypted message. The policy can be formed with the help of attribut...
With scaling of Vt sub-threshold leakage power is increasing and expected to become significant part of total power consumption.In present work three new configurations of level s...