Browsing Computer Science and Automation (CSA) by Title
Now showing items 303322 of 381

QuantumSafe IdentityBased Signature Scheme in Multivariate Quadratic Setting
Cryptographic techniques are essential for the security of communication in modern society. Today, nearly all public key cryptographic schemes used in practice are based on the two problems of factoring large integers and ... 
Rainbow Colouring and Some Dimensional Problems in Graph Theory
(20180405)This thesis touches three diﬀerent topics in graph theory, namely, rainbow colouring, product dimension and boxicity. Rainbow colouring An edge colouring of a graph is called a rainbow colouring, if every pair of vertices ... 
Rainbow Connection Number Of Graph Power And Graph Products
(20140909)The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. ... 
Ranking from Pairwise Comparisons : The Role of the Pairwise Preference Matrix
(20180705)Ranking a set of candidates or items from pairwise comparisons is a fundamental problem that arises in many settings such as elections, recommendation systems, sports team rankings, document rankings and so on. Indeed it ... 
Rational Secure Computation: New Definitions and Constructions
Cryptography and Game Theory are two fascinating areas of modern computing, and there have been numerous works since the early 2000s to bridge these. While cryptography provides mechanisms to detect deviations, game theory ... 
Recommendations in Complex Networks: Unifying Structure into Random Walk
Making recommendations or predicting links which are likely to exist in the future is one of the central problems in network science and graph mining. In spite of modern stateof theart approaches for link prediction, ... 
Reconstruction of 3D Neuronal Structures
(20180317)Microscopic analysis of biological structures can be significantly enhanced by representing the object of study as a threedimensional entity. To assist neurobiologists investigate the molecular mechanisms involved in ... 
Recovery Algorithms for planted structures in Semirandom models
For many NPhard problems, the analysis of bestknown approximation algorithms yields “poor” worstcase guarantees. However, using various heuristics, the problems can be solved (to some extent) in reallife instances. ... 
Recovery From DoS Attacks In MIPv6 : Modelling And Validation
(20100726)DenialofService (DoS) attacks form a very important category of security threats that are possible in MIPv6 (Mobile Internet Protocol version 6). This thesis proposes a scheme for participants (Mobile Node, Home Agent, ... 
Reeb Graphs : Computation, Visualization and Applications
(20180223)Level sets are extensively used for the visualization of scalar fields. The Reeb graph of a scalar function tracks the evolution of the topology of its level sets. It is obtained by mapping each connected component of a ... 
A RefinementBased Methodology for Verifying Abstract Data Type Implementations
(20180621)This thesis is about techniques for proving the functional correctness of Abstract Data Type (ADT) implementations. We provide a framework for proving the functional correctness of imperative language implementations of ... 
Reinforcement Learning Algorithms for OffPolicy, MultiAgent Learning and Applications to Smart Grids
Reinforcement Learning (RL) algorithms are a popular class of algorithms for training an agent to learn desired behavior through interaction with an environment whose dynamics is unknown to the agent. RL algorithms ... 
Reliability Modelling Of Whole RAID Storage Subsystems
(20140605)Reliability modelling of RAID storage systems with its various components such as RAID controllers, enclosures, expanders, interconnects and disks is important from a storage system designer's point of view. A model that ... 
Representing Networks: Centrality, Node Embeddings, Community Outliers and Graph Representation
Networks are ubiquitous. We start our technical work in this thesis by exploring the classical concept of node centrality (also known as influence measure) in information networks. Like clustering, node centrality is also ... 
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
(20171216)In many real world situations, especially involving multiagent systems and artificial intelligence, participating agents often need to agree upon a common alternative even if they have differing preferences over the available ... 
Resource Allocation for Sequential Decision Making Under Uncertainaty : Studies in Vehicular Traffic Control, Service Systems, Sensor Networks and Mechanism Design
(20171127)A fundamental question in a sequential decision making setting under uncertainty is “how to allocate resources amongst competing entities so as to maximize the rewards accumulated in the long run?”. The resources allocated ... 
Retweet Profiling  Study Dissemination of Twitter Messages
(20170923)Social media has become an important means of everyday communication. It is a mechanism for “sharing” and “resharing” of information. While social network platforms provide the means to users for resharing/reblogging (aka ... 
Revisiting Statistical Techniques for Result Cardinality Estimation
The Relational Database Management Systems (RDBMS) constitute the backbone of today's informationrich society, providing a congenial environment for handling enterprise data during its entire life cycle of generation, ... 
Robust Algorithms for recovering planted structures in Semirandom instances
In this thesis, we study algorithms for three fundamental graph problems. These are NPhard problems which have not been understood completely as there is a signifiicant gap between the algorithmic and the hardness fronts ...