Browsing Computer Science and Automation (CSA) by Title
Now showing items 220-239 of 552
-
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 ... -
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 ... -
Grobuer Basis Algorithms for Polynomial Ideal Theory over Noetherian Commutative Rings
(2018-05-14)One of the fundamental problems in commutative algebra and algebraic geometry is to understand the nature of the solution space of a system of multivariate polynomial equations over a field k, such as real or complex ... -
Guarding Terrain using k-Watchtowers
The discrete k-watchtower problem for a polyhedral terrain T in R3 with n vertices is to nd k vertical segments, called watchtowers, of smallest height, whose bottom end-points (bases) lie on some vertices of T, and ... -
Hadwiger number and the cartesian product operation on graphs
Abstract page scanned and attached as separate attachment -
Hadwiger's Conjecture On Circular Arc Graphs
(2009-04-30)Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph theory. Hadwiger’s conjecture states that if the chromatic number of a graph G is k, then G has a clique minor of size at ... -
Handling Overloads with Social Consistency
Cloud computing applications have dynamic workloads, and they often observe spikes in the incoming traffic which might result in system overloads. System overloads are generally handled by various load balancing techniques ... -
Hard Drive Failure Prediction : A Rule Based Approach
(2011-07-12)The ability to accurately predict an impending hard disk failure is important for reliable storage system design. The facility provided by most hard drive manufacturers, called S.M.A.R.T. (self-monitoring, analysis and ... -
Heterogeneity Aware Shared DRAM Cache for Integrated Heterogeneous Architectures
Integrated Heterogeneous System (IHS) processors pack throughput-oriented GPGPUs along-side latency-oriented CPUs on the same die sharing certain resources, e.g., shared last level cache, network-on-chip (NoC), and the ...