An acyclic edge coloring of a graph G is a proper edge coloring of G which has no dichromatic cycle. The minimum number of colors required to acyclically edge color graph G is called its acyclic chromatic index, denoted ...

This work considers the use of commodity graphics processing units (GPUs) for accelerating run-time critical phase of method of moments (MoM) which is a widely used computational electromagnetic (CEM) technique for solving ...

The rapid progress in the field of wireless communication ans MEMS technology has made wireless sensor networks (WSN) possible. These networks may have low cost sensors deployed which are capable of sensing any activity ...

c-means (k-means) is a popular algorithm for cluster analysis. Many variants of c-means algorithms are available. All these models are studied in depth and convergence of iterative solutions are verified, in this thesis. ...

Given a universal set and its subsets, intersection graph can be characterized as the graph with one distinct subset of given universal set for each vertex of the graph and any two non-adjacent vertices have no element ...

For any system, sparse or dispersive, z2 proportionate algorithm of Proportionate Normalized Least Mean Square (PtNLMS) class, gives the best convergence rate compare to any other weiner filter based iterative algorithms. ...

This thesis involves studying total graphs which are auxiliary graphs used to transform the total colouring problem of a graph into vertex colouring problem of the total graph. Not all graphs are total graphs but each ...

In our work we are supposed to test whether the generated distributed implementation(or distributed network) behaves similar to that of given specification. We are doing this over synchronously communicating FSMs(Finite State ...