Browsing Computer Science and Automation (CSA) by thesis submitted date"2010"
Now showing items 1-9 of 9
-
Acyclic Edge Coloring Of Graphs
(2013-10-07)A proper edge coloring of G =(V,E)is a map c : E → C (where C is the set of available colors ) with c(e) ≠ c(ƒ) for any adjacent edges e,f. The minimum number of colors needed to properly color the edges of G, is called ... -
Cluster Identification : Topic Models, Matrix Factorization And Concept Association Networks
(2013-09-17)The problem of identifying clusters arising in the context of topic models and related approaches is important in the area of machine learning. The problem concerning traversals on Concept Association Networks is of great ... -
Hard Drive Failure Prediction : A Rule Based Approach
(2011-07-12)The ability to accurately predict an impending hard disk failure is important for reliable storage system design. The facility provided by most hard drive manufacturers, called S.M.A.R.T. (self-monitoring, analysis and ... -
Image Structures For Steganalysis And Encryption
(2013-10-21)In this work we study two aspects of image security: improper usage and illegal access of images. In the first part we present our results on steganalysis – protection against improper usage of images. In the second part ... -
Low Power Test Methodology For SoCs : Solutions For Peak Power Minimization
(2013-09-13)Power dissipated during scan testing is becoming increasingly important for today’s very complex sequential circuits. It is shown that the power dissipated during test mode operation is in general higher than the power ... -
A Low-Complexity Algorithm For Intrusion Detection In A PIR-Based Wireless Sensor Network
(2011-08-25)This thesis investigates the problem of detecting an intruder in the presence of clutter in a Passive Infra-Red (PIR) based Wireless Sensor Network (WSN). As one of the major objectives in a WSN is to maximize battery life, ... -
Novel Mechanisms For Allocation Of Heterogeneous Items In Strategic Settings
(2012-04-20)Allocation of objects or resources to competing agents is a ubiquitous problem in the real world. For example, a federal government may wish to allocate different types of spectrum licenses to telecom service providers; a ... -
On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem
(2013-05-21)There has been a rapid increase interest in computational number theory ever since the invention of public-key cryptography. Various attempts to solve the underlying hard problems behind public-key cryptosystems has led ...