Browsing Computer Science and Automation (CSA) by Title
Now showing items 41-60 of 545
-
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 ... -
AMI-The language and its implementation
Automatic translation of sequential programs to parallel programs which can reasonably exploit distributed memory machines is very difficult and not well-understood. Programming with communication-based statements is very ... -
An integrated relational database for computer-aided design applications
In view of the widespread use of Computer Aided Design (CAD) systems, the problem of storing data efficiently (in terms of memory requirements and the time required to access it) is of considerable importance. This thesis ... -
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 ... -
Application of finite graph models of context fue languages.
A finite graph model for a context?free language is proposed. The model is called an extended transition system; its nodes encode [pushdown automata state, top stack symbol] pairs and its arcs encode pushdown automaton ... -
Application of trust region on methods to learning in feed forward neural networks
This thesis presents a novel algorithm for training feed-forward neural networks, addressing the limitations of the widely used back-propagation and Quickprop algorithms. While Quickprop is significantly faster than standard ... -
Approximate decoding over tail-biting trellises
This thesis proposes and implements soft-decision decoding algorithms on tail-biting trellises. For linear block codes, tail-biting trellises are interesting from a soft-decision decoding view-point, because of their reduced ... -
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 ... -
Approximation algorithms for the K- MST problem
Given a graph GGG on nnn vertices, the kkk-MST optimization problem is to find a tree spanning at least kkk vertices of GGG such that the cost of the tree is minimized over all such possible trees. The main contribution ... -
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 ...