Browsing Computer Science and Automation (CSA) by thesis submitted date"2006"
Now showing items 1-16 of 16
-
Analysis And Design Of Image And Video Encryption Algorithms
(2009-03-19)The rapid growth in multimedia based Internet systems and applications like video telephony, video on demand, network based DVD recorders and IP television has created a substantial need for ... -
Caching Techniques For Dynamic Web Servers
(2009-03-20)Websites are shifting from static model to dynamic model, in order to deliver their users with dynamic, interactive, and personalized experiences. However, dynamic content generation comes at a cost – each request ... -
Design Of Incentive Compatible Broadcast Protocols For Ad hoc Wireless Networks : A Game Theoretic Approach
(2008-01-16)An ad hoc wireless network is an infrastructure-less, autonomous system of nodes connected through wireless links. In many current applications of ad hoc wireless networks, individual wireless nodes are autonomous, rational, ... -
Design Of Innovative Mechanisms For Contemporary Game Theoretic Problems In Electronic Commerce
(2008-09-09)Game theory and mechanism design have emerged as an important tool to model, analyze,and solve decentralized design problems involving multiple agents that interact strategically in a rational and intelligent way. Some ... -
Discovering Roles In The Evolution Of Collaboration Networks
(2009-04-02)Searching the Web involves more than sifting through a huge graph of pages and hyperlinks. Specific collaboration networks have emerged that serve domain-specific queries better by exploiting the principles and patterns ... -
Efficient Bandwidth Constrained Routing Protocols For Communication Networks
(2007-10-24)QoS routing is one of the major building blocks for supporting QoS in communication networks and, hence, a necessary component of future communication networks. Bandwidth- Constrained Routing Algorithm (BCRA) may help to ... -
Efficient computations with special large sparse matrices
Large sparse matrices find many applications in cryptography. A large sparse matrix is a matrix of huge dimensions but the number of nonzero entries per row of the matrix is very small. Most of the times, it is possible ... -
Hadwiger number and the cartesian product operation on graphs
Abstract page scanned and attached as separate attachment -
Integrating A New Cluster Assignment And Scheduling Algorithm Into An Experimental Retargetable Code Generation Framework
(2009-03-09)This thesis presents a new unified algorithm for cluster assignment and acyclic region scheduling in a partitioned architecture, and preliminary results on its integration into an experimental retargetable code generation ... -
Large Data Clustering And Classification Schemes For Data Mining
(2009-03-20)Data Mining deals with extracting valid, novel, easily understood by humans, potentially useful and general abstractions from large data. A data is large when number of patterns, number of features per pattern or both are ... -
A Mechanism Design Approach To Resource Procurement In Computational Grids With Rational Resource Providers
(2009-07-08)A computational grid is a hardware and software infrastructure that provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities. In the presence of grid users who are autonomous, ... -
On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions
(2008-01-29)Kullback-Leibler relative-entropy or KL-entropy of P with respect to R defined as ∫xlnddPRdP , where P and R are probability measures on a measurable space (X, ), plays a basic role in the definitions of classical information ... -
On the expressiveness of metric temporal logic
Temporal Logics are a popular formalism for specification of properties in the verification of reactive systems. They can be employed to reason about the behavior of systems with the evolution of time. For example, one can ... -
Procurement Network Formation : A Cooperative Game Theoretic Approach
(2009-04-16)Complex economic activity often involves inter-relationships at several levels of production, often referred to as supply chains or procurement networks. In this thesis we address the problem of forming procurement networks ... -
Scalable Low Power Issue Queue And Store Queue Design For Superscalar Processors
(2009-03-09)A Large instruction window is a key requirement to exploit greater Instruction Level Parallelism in out-of-order superscalar processors. Along with the instruction window size, the size of various other structures including ... -
Superscalar Processor Models Using Statistical Learning
(2009-06-24)Processor architectures are becoming increasingly complex and hence architects have to evaluate a large design space consisting of several parameters, each with a number of potential settings. In order to assist in guiding ...

