Browsing Computer Science and Automation (CSA) by Title
Now showing items 145164 of 380

Fast Algorithms for Max Cut on Geometric Intersection Graphs
In this work, we design fast algorithms for max cut on geometric intersection graphs. In the maximum cut (a.k.a., max cut) problem, the input is an undirected graph, and the goal is to partition the vertex set into two ... 
Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control
(20170920)Many sequential decision making problems under uncertainty arising in engineering, science and economics are often modelled as Markov Decision Processes (MDPs). In the setting of MDPs, the goal is to and a state dependent ... 
Feature Selection under Multicollinearity & Causal Inference on Time Series
(20180820)In this work, we study and extend algorithms for Sparse Regression and Causal Inference problems. Both the problems are fundamental in the area of Data Science. The goal of regression problem is to nd out the \best" ... 
A FineGrained Dynamic Information Flow Analysis for Android Apps
(20180820)Android has been steadily gaining popularity ever since its launch in 2008. One of the major factors for this is the easy availability of a large variety of apps. They range from simple apps such as calculator apps to apps ... 
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 ... 
A Framework for PrivacyCompliant 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 ... 
Fully Resilient NonInteractive IDBased Hierarchical Key Agreement
NonInteractive Key Agreement (NIKA) is a cryptographic primitive which allows two parties to agree on a shared secret key without any interaction. Identitybased NonInteractive Key Agreement (IDNIKA) allows each party ... 
Fully Resilient NonInteractive IDBased Hierarchical Key Agreement
NonInteractive Key Agreement (NIKA) is a cryptographic primitive which allows two parties to agree on a shared secret key without any interaction. Identitybased NonInteractive Key Agreement (IDNIKA) allows each party ... 
Game Theoretic Models For Social Network Analysis
(20140801)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 ... 
GameTheoretic Analysis of Strategic Behaviour in Networks, Crowds and Classrooms
(20180103)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 ... 
Generalization of Hitting, Covering and Packing Problems on Intervals
(20180529)Interval graphs are well studied structures. Intervals can represent resources like jobs to be scheduled. Finding maximum independent set in interval graphs would correspond to scheduling maximum number of nonconflicting ... 
Generalizations Of The Popular Matching Problem
(20130702)Matching problems arise in several realworld scenarios like assigning posts to applicants, houses to trainees and roommates to one another. In this thesis we consider the bipartite matching problem where one side of the ... 
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
(20171130)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
(20140409)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
(20180514)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 kWatchtowers
The discrete kwatchtower problem for a polyhedral terrain T in R3 with n vertices is to nd k vertical segments, called watchtowers, of smallest height, whose bottom endpoints (bases) lie on some vertices of T, and ... 
Hadwiger's Conjecture On Circular Arc Graphs
(20090430)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 ...