Search
Now showing items 61-70 of 124
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 ...
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 ...
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 ...
Optimizations In Storage Area Networks And Direct Attached Storage
(2009-07-23)
The thesis consists of three parts.
In the first part, we introduce the notion of device-cache-aware schedulers. Modern disk
subsystems have many megabytes of memory for various purposes such as prefetching and caching. ...
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 ...
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 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, ...
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 ...
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 ...
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 ...