Browsing by Subject "Computer algorithms"
Now showing items 1-7 of 7
-
Disparity estimation by stereo using particle swarm optimization and graph cuts
(Dhirubhai Ambani Institute of Information and Communication Technology, 2010)Stereo vision is based on the process of obtaining the disparity from a left and a right view of a scene. By obtaining the disparity, we find the distance (depth) of each object point from the camera so that we can construct ... -
Efficient ASIC implementation of advanced encryption standard
(Dhirubhai Ambani Institute of Information and Communication Technology, 2008)In spite of the many defense techniques, software vulnerabilities like buffer overflow, format string vulnerability and integer vulnerability is still exploited by attackers. These software vulnerabilities arise due to ... -
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 ... -
Exact algorithm for segment based sequence alignment
(Dhirubhai Ambani Institute of Information and Communication Technology, 2015)In bioinformatics, proteins, large biological molecules consisting long chain of amino acids, are described by a sequence of 20 amino acids. To analyze these protein sequences pairwise alignment is being used, which ... -
On size balanced binary search trees
(Dhirubhai Ambani Institute of Information and Communication Technology, 2009)History independent data structures are useful when security and privacy are of primary concern. Even if an adversary gets copy of the data structure, he cannot obtain any additional information beyond its content. Important ... -
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 ...