Search
Now showing items 1-10 of 14
Acyclic edge coloring of complete r-partite graphs
(Dhirubhai Ambani Institute of Information and Communication Technology, 2011)
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 ...
GPU-accelerated method of moments
(Dhirubhai Ambani Institute of Information and Communication Technology, 2015)
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 ...
Robust surface coverage using deterministic grid based deployment in wireless sensor networks
(Dhirubhai Ambani Institute of Information and Communication Technology, 2010)
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 ...
Study of fuzzy clustering algorithms and enhanced fuzzy reasoning application to texture based image segmentation
(Dhirubhai Ambani Institute of Information and Communication Technology, 2015)
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. ...
Testing Labelled Transition System
(Dhirubhai Ambani Institute of Information and Communication Technology, 2017)
"For a successful interaction among computer systems from distinct manufactures, standardize communication protocol are being generated and specified. Implementation of those protocol are required that conforms to those ...
The Study of Vertex Coloring Algorithms Using Heuristic Approaches
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
Graph vertex coloring is one of the most studied NP-complete optimization problem (READ, 1972) [2]. The problem is that; given a graph G, determine the number of colors required to color G, so that no two adjacent vertices ...
The Study of Cycles in 2-connected Graphs Specifically Odd Graphs
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
Counting the number of cycles in an undirected graph is a classical problemwhich
is known to be intractable and so research on this problem typically focuses on approximation
algorithms, special cases, heuristics and some ...
Microwave Imaging for Breast Cancer Detection using 3D Level Set based Optimization, FDTD Method and Method of Moments
(Dhirubhai Ambani Institute of Information and Communication Technology, 2019)
Microwave imaging is emerging as new diagnostic option for breast cancer detection because of non-ionizing nature of microwave radiation and significant contrast between dielectric properties of healthy and malignant breast ...
From extractive to abstractive summarization: a journey
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
Research in the field of text summarisation has primarily been dominated by investigationsof various sentence extraction techniques with a significant focus towards news articles.In this thesis, we intend to look beyond ...
Distributed TDMA scheduling in tree based wireless sensor networks with multiple data attributes and multiple sinks
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
Data collection is an important application of wireless sensor networks. Sensors are deployed in given region of interest. They sense physical quantity like temperature, pressure, solar radiation, speed and many others. ...