Browsing Computer Science and Automation (CSA) by Title
Now showing items 29-48 of 394
-
Algorithms for various cost criteria in Reinforcement Learning
In this thesis we will look at various Reinforcement Learning algorithms. We will look at algorithms for various cost criteria or reward objectives namely Finite Horizon, Discounted Cost, Risk-Sensitive Cost. For Finite ... -
Algortihms for Individual and Collective Fairness Measures
The problem of fair allocation has been a central topic in economic theory, and the literature on fair division has provided fundamental insights on how to allocate resources among agents in a fair manner. By drawing upon ... -
Analysing Message Sequence Graph Specifications
(2011-03-29)Message Sequence Charts are a visual representation of the system specification which shows how all the participating processes are interacting with each other. Message Sequence Graphs provide modularity by easily allowing ... -
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 ... -
Analysis and Methods for Knowledge Graph Embeddings
Knowledge Graphs (KGs) are multi-relational graphs where nodes represent entities, and typed edges represent relationships among entities. These graphs store real-world facts such as (Lionel Messi, plays-for-team, Barcelona) ... -
Analysis Of A Sieving Heuristic For The Number Field Sieve And Design Of Low-Correlation CDMA Sequences
(2011-01-25)In this thesis, we investigate in detail, certain important problems in cryptography and coding theory. In the first part of this thesis, we discuss the number field sieve and compare the two ways in which the sieving ... -
Analysis, Design, and Acceleration of DNN Training Preprocessing Pipelines
The performance of deep neural network (DNN) training is a function of both the training compute latency and the latency to fetch and preprocess the input data needed to train the model. With advance- ments in GPUs and ... -
Ankora: Notions of Multi-party Computation and Zero-knowledge Beyond Conventional Models
In the era of digitalization, data privacy and integrity are of utmost importance. Secure multiparty computation (MPC) and zero-knowledge (ZK) facilitate data privacy and integrity. MPC enables privacy-preserving collaborative ... -
Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application
(2018-08-13)Problems involving optimal sequential making in uncertain dynamic systems arise in domains such as engineering, science and economics. Such problems can often be cast in the framework of Markov Decision Process (MDP). ... -
Approximation Algorithms for Geometric Packing and Covering Problems
We study a host of geometric optimization problems that are NP-hard and design polynomial time approximation algorithms for them. More precisely, we are given a family of geometric objects and a point set, mostly in the ... -
Approximation Algorithms for Geometric Packing Problems
We study approximation algorithms for the geometric bin packing problem and its variants. In the two-dimensional geometric bin packing problem (2D GBP), we are given n rectangular items and we have to compute an axis-parallel ... -
Architecture Descriptions for Retargetable Code Translation
(Indian Institute of Science, 2005-03-14)The study of architectural parameterization has long neglected other parameterizations in favour of code selector descriptions. In this dissertation, we are concerned with providing linguistic notations for modelling ... -
Architecture, Performance and Applications of a Hierarchial Network of Hypercubes
(Indian Institute of Science, 2005-02-09)This thesis, presents a multiprocessor topology, the hierarchical network of hyper-cubes, which has a low diameter, low degree of connectivity and yet exhibits hypercube like versatile characteristics. The hierarchical ... -
Automated Test Generation and Performance Improvement using Dynamic Program Analysis
Software development process consists of various stages like design, implementation, and testing. Since programmers are considerably involved in these stages, their intuition and expertise play a vital role in the success ... -
Automatic Data Allocation, Buffer Management And Data Movement For Multi-GPU Machines
(2017-05-24)Multi-GPU machines are being increasingly used in high performance computing. These machines are being used both as standalone work stations to run computations on medium to large data sizes (tens of gigabytes) and as a ... -
Automatic Data Partitioning By Hierarchical Genetic Search
(Indian Institute of Science, 2005-12-07)The introduction of languages like High Performance Fortran (HPF) which allow the programmer to indicate how the arrays used in the program have to be distributed across the local memories of a multi-computer has not ... -
Automatic Optimization of Geometric Multigrid Methods using a DSL Approach
(2018-06-14)Geometric Multigrid (GMG) methods are widely used in numerical analysis to accelerate the convergence of partial differential equations solvers using a hierarchy of grid discretizations. These solvers find plenty of ... -
Automatic Storage Optimization of Arrays Affine Loop Nests
(2018-03-01)Efficient memory usage is crucial for data-intensive applications as a smaller memory footprint ensures better cache performance and allows one to run a larger problem size given a axed amount of main memory. The solutions ... -
Autonomous Spacecraft Mission Planning And Execution In A Petri Net Framework
(2014-08-01)Presently, most spacecraft are controlled from ground involving activities such as up-linking the schedule of daily operations and monitoring health parameters. These activities lead to a cognitive overload on human ...