Browsing Computer Science and Automation (CSA) by Title
Now showing items 216-235 of 559
-
Formal tools for specification-driven protocol design of distributed computing systems
The widespread use of Distributed Computing Systems (DCSs) is due to the advantages of better performance, improved reliability, efficient resource sharing and easy upgradability. In order to realize the advantages of a ... -
Fragile Interpretations and Interpretable models in NLP
Deploying deep learning models in critical areas where the cost of making a wrong decision leads to a substantial financial loss, like in the banking domain, or even loss of life, like in the medical field, is significantly ... -
Frames as abstractions for efficient multimedia object retrieval
Multimedia Information Systems (MMISs) integrate various media types - text, audio, video, graphics, and animation - for machine-processable storage, retrieval, and presentation. These systems are characterized by complex ... -
A Framework for Privacy-Compliant Delivery Drones
We present Privaros, a framework to enforce privacy policies on drones. Privaros is designed for commercial delivery drones, such as the ones that will likely be used by Amazon Prime Air. Such drones visit a number of host ... -
Framework for solving vehicle scheduling problems using AI techniques
Transportation resource scheduling problems are of high academic as well as practical value. These are primarily concerned with generation of movement schedules for a set of vehicles (tankers, aircraft, etc) to distribute ... -
A framework for timing analysis of event-driven applications
Event-driven applications, particularly those based on the publish–subscribe communication model are widely adopted to build responsive and decoupled applications in domains such as robotics, the Internet of Things ... -
Fully Resilient Non-Interactive ID-Based Hierarchical Key Agreement
Non-Interactive Key Agreement (NIKA) is a cryptographic primitive which allows two parties to agree on a shared secret key without any interaction. Identity-based Non-Interactive Key Agreement (ID-NIKA) allows each party ... -
Functional test generation for synchronous sequential circuits
In this work, we present a novel approach to generate functional test sequences for synchronous sequential non scan circuits. The method is applicable when the functional description of the circuit can be obtained in the ... -
Galois field Computations : Implementation of a Library and a study of the Discrete Logarithm Problem
Computation over finite fields (also called Galois fields) is an active area of research in number theory and algebra, and finds many applications in cryptography, error control coding, and combinatorial design. In this ... -
Game Theoretic Models For Social Network Analysis
(2014-08-01)With increasing demand for social network based activities, it is very important to understand not only the structural properties of social networks but also how social networks form, to better exploit their promise and ... -
Game-Theoretic Analysis of Strategic Behaviour in Networks, Crowds and Classrooms
(2018-01-03)Over the past decade, the explosive growth of the Internet has led to a surge of interest to understand and predict aggregate behavior of large number of people or agents, particularly when they are connected through an ... -
Gap between outcomes of voting rules
Through the course of history, a variety of voting rules have been used to determine election outcomes. The traditional way in social choice theory to evaluate a voting rule is by checking whether it satisfies axioms deemed ... -
Gaussian processes for learning problems with related outputs
Gaussian processes (GPs) have attracted much attention in the machine learning community due to their promising generalization performance and unique properties. GPs provide a Bayesian non-parametric approach to learning ... -
Generalization of Hitting, Covering and Packing Problems on Intervals
(2018-05-29)Interval graphs are well studied structures. Intervals can represent resources like jobs to be sched-uled. Finding maximum independent set in interval graphs would correspond to scheduling maximum number of non-conflicting ... -
Generalizations Of The Popular Matching Problem
(2013-07-02)Matching problems arise in several real-world scenarios like assigning posts to applicants, houses to trainees and room-mates to one another. In this thesis we consider the bipartite matching problem where one side of the ... -
Genetic algorithms: novel models and fitness -based adaptive disruption strategies
Genetic Algorithms are robust search and optimization methods that have emerged to be effective for a variety of real-world problems. They are stochastic, iterative techniques based on a population of evolving solutions, ... -
Geometric and Topological Methods for Biomolecular Visualization
Biomolecules like proteins are the basic building blocks of living systems. It has been observed that the structure of a biomolecule plays an important role in defining its function. In this thesis, we describe novel ... -
A GPU Accelerated Tensor Spectral Method for Subspace Clustering
(2017-11-30)In this thesis we consider the problem of clustering the data lying in a union of subspaces using spectral methods. Though the data generated may have high dimensionality, in many of the applications, such as motion ... -
Graph Models For Query Focused Text Summarization And Assessment Of Machine Translation Using Stopwords
(2014-04-09)Text summarization is the task of generating a shortened version of the original text where core ideas of the original text are retained. In this work, we focus on query focused summarization. The task is to generate the ...