Computer Science and Automation (CSA): Recent submissions
Now showing items 501-520 of 545
-
Experimental Studies On A New Class Of Combinatorial LDPC Codes
(2009-06-05)We implement a package for the construction of a new class of Low Density Parity Check (LDPC) codes based on a new random high girth graph construction technique, and study the performance of the codes so constructed on ... -
Design Of Incentive Compatible Mechanisms For Ticket Allocation In Software Maintenance Services
(2009-05-28)Software Maintenance is becoming more and more challenging due to rapidly changing customer needs, technologies and need for highly skilled labor. Many problems that existed a decade ago continue to exist or have even ... -
Bounds On Augmented Automata And Quantum Adiabatic Optimization
(2009-05-25)Quantum computing has generated a lot of interested in the past two decades. Research into powerful models of quantum computation has yielded important and elegant results like an efficient algorithm for factoring and a ... -
Spill Code Minimization And Buffer And Code Size Aware Instruction Scheduling Techniques
(2009-05-19)Instruction scheduling and Software pipelining are important compilation techniques which reorder instructions in a program to exploit instruction level parallelism. They are essential for enhancing instruction level ... -
Computational Problems In Codes On Graphs
(2009-05-11)Two standard graph representations for linear codes are the Tanner graph and the tailbiting trellis. Such graph representations allow the decoding problem for a code to be phrased as a computational problem on the corresponding ... -
Hadwiger's Conjecture On Circular Arc Graphs
(2009-04-30)Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph theory. Hadwiger’s conjecture states that if the chromatic number of a graph G is k, then G has a clique minor of size at ... -
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 ... -
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 ... -
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 ... -
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 ... -
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 ... -
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 ... -
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 ... -
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 ... -
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 ... -
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, ... -
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 ... -
Algorithms For Efficient Implementation Of Secure Group Communication Systems
(2007-10-23)A distributed application may be considered as a set of nodes which are spread across the network, and need to communicate with each other. The design and implementation of these distributed applications is greatly simplified ... -
IMAGINE : An Intelligent Electonic Marketplace
(Indian Institute of Science, 2007-01-16)In recent times, the Internet revolution has spawned numerous innovative enterprises-virtual companies, and electronic markets. Electronic markets (or digital markets) are scalable web-based platforms for buyers, sellers, ... -
Hyperplane Partitioning : An Approach To Global Data Partitioning For Distributed Memory Machines
(Indian Institute of Science, 2005-12-07)Automatic Global Data Partitioning for Distributed Memory Machines (DMMs) is a difficult problem. Distributed memory machines are scalable, but since the memory is distributed across processors, the scheme of placement ...

