Browsing M Tech Dissertations by Subject "Algorithms"
Now showing items 1-20 of 21
-
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 ... -
Designing an optimized linear adaptive filtering algorithm
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)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. ... -
Efficient algorithms for hierarchical online rule mining
(Dhirubhai Ambani Institute of Information and Communication Technology, 2006)Association rule Mining, as one of the technologies equipped with Data Mining, deals with the challenge of mining the informative associations from the fast accumulating data. From the past decade, the research community ... -
Embedding binary trees and caterpillars into the hypercube
(Dhirubhai Ambani Institute of Information and Communication Technology, 2008)Embedding graphs is an important and well-studied theory in parallel computing. Finding the embedding of trees into hypercubes is an important, interesting and difficult problem. This work studies the embedding of binary ... -
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 ... -
High-speed 512-point FFT single-chip processor architecture
(Dhirubhai Ambani Institute of Information and Communication Technology, 2008)This thesis present a fully parallel novel fixed point 16-bit word width 512 point FFT processor architecture. The 512 point FFT is realized by decomposing it into three 8 point FFT units. This approach reduces the number ... -
Improved algorithms for modular multiplication and its application to block cipher RC6
(Dhirubhai Ambani Institute of Information and Communication Technology, 2004)This thesis explores the area of hardware implementation of block ciphers. An al¬gorithm for modular multiplication is proposed which is efficient in terms of speed and area. To demonstrate the effectiveness of the algorithm ... -
Localization for a habitat monitoring sensor network for ground turtles
(Dhirubhai Ambani Institute of Information and Communication Technology, 2007)This thesis work deals with the localization problem (i.e. finding the location of the sensor nodes) in sensor networks. This work is specifically concerned with the localization of the sensor nodes on small ground turtles ... -
Object classification in images using information slicing
(Dhirubhai Ambani Institute of Information and Communication Technology, 2008)Human visual system, in real world, identifies objects by their shapes, sizes and colors. More than often we identify objects around us specifically by using contextual knowledge of the objects. For example, an area of ... -
On path complexities of heapsort algorithm and the class stack
(Dhirubhai Ambani Institute of Information and Communication Technology, 2007)A measure of program complexity, called Path Complexity, based on the number of program execution paths as a function of the input size n, is proposed in [AJ05]. This measure can be used to compare the complexity of two ... -
Path complexity of maximum segment sum problem
(Dhirubhai Ambani Institute of Information and Communication Technology, 2009)Various software complexity metrics have been proposed in literature. A program complexity measure called path complexity is proposed in [1]. Path complexity P(A,n) of an algorithm A is defined to be the number of program ... -
Path complexity of the class binary search tree
(Dhirubhai Ambani Institute of Information and Communication Technology, 2009)Path complexity of a program is defined as the number of program execution paths as a function of input size n. This notion of program complexity has been extended to complexity of a class as follows. Class had data members ... -
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 ... -
Set labeling of graphs
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)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 ... -
Spectral estimation using WRLS algorithm for multiband detection
(Dhirubhai Ambani Institute of Information and Communication Technology, 2008)Signal parameter estimation in the presence of noise has been a key area of research. Many applications have benefited from advancements made in this field within the last two decades. The method proposed in the thesis ... -
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 ... -
Testing synchronously communicating distributed systems
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)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 ... -
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 ... -
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 ...