Browsing Computer Science and Automation (CSA) by Title
Now showing items 33-52 of 552
-
Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks
(2018-05-09)In this thesis, we consider stochastic systems which arise in different real-world application contexts. The first problem we consider is based on product adoption and pricing. A monopolist selling a product has to appropriately ... -
Algorithms for Social Good in Online Platforms with Guarantees on Honest Participation and Fairness
Recent decades have seen a revolution in the way people communicate, buy products, learn new things, and share life experiences. This has spurred the growth of online platforms that enable users from all over the globe to ... -
Algorithms for some problems on trees and graphs
Design and analysis of graph algorithms is an active area of research in Computer Science. Trees form an important subclass of graphs and have vast applications. In this thesis, we present some new algorithmic results on ... -
Algorithms For Stochastic Games And Service Systems
(2014-04-23)This thesis is organized into two parts, one for my main area of research in the field of stochastic games, and the other for my contributions in the area of service systems. We first provide an abstract for my work in ... -
Algorithms for Stochastic Optimization, Statistical Estimation and Markov Decision Processes
Stochastic approximation deals with the problem of finding zeros of a function expressed as an expectation of a random variable. In this thesis we propose convergent algorithms for problems in optimization, statistical ... -
Algorithms for testing planarity of chordal graphs and hamiltonicity of planar chordal graphs.
Design and analysis of graph algorithms is an active research area in Computer Science. Designing efficient algorithms for graph problems is both challenging and rewarding from the point of view of theory and applications. ... -
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 ...