Browsing Computer Science and Automation (CSA) by thesis submitted date"2023"
Now showing items 1-18 of 18
-
Algorithmic Problems on Vertex Deletion and Graph Coloring
In the thesis, we mainly discuss variants of two well-studied graph theoretical problems - vertex deletion problem and graph coloring problem - both have been used to tackle many real-world problems in diverse fields. Vertex ... -
Algorithms for Achieving Fairness and Efficiency in Matching Problems
Matching problems arise in numerous practical settings. Fairness and efficiency are two desirable properties in most such real world scenarios. This dissertation work presents new approaches and models for capturing and ... -
Algorithms for Geometric Packing and Covering Problems
We study two fundamental problems related to geometric packing and covering, and design algorithms with improved worst-case performance guarantees for them. These problems have numerous applications in resource allocation, ... -
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 ... -
Average Reward Actor-Critic with Deterministic Policy Search
The average reward criterion is relatively less studied as most existing works in the Reinforcement Learning literature consider the discounted reward criterion. There are few recent works that present on-policy average ... -
CodeQueries: Benchmarking Query Answering over Source Code
Software developers often make queries about the security, performance effectiveness, and maintainability of their code. Through an iterative debugging process, developers analyze the code to find answers to these ... -
Exploring Welfare Maximization and Fairness in Participatory Budgeting
Participatory budgeting (PB) is a voting paradigm for distributing a divisible resource, usually called a budget, among a set of projects by aggregating the preferences of individuals over these projects. It is implemented ... -
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 ... -
Improved approximation bounds on maximum edge q coloring of dense graphs
The anti-Ramsey number ar(G,H) with input graph G and pattern graph H, is the maximum positive integer k such that there exists an edge coloring of G using k colors, in which there are no rainbow subgraphs isomorphic to ... -
Maximum Independent Set of Rectangles - An Empirical Study
We study the Maximum Independent Set of Rectangles (MISR) problem. The problem involves a collection of n axis-parallel rectangles in 2D with weights. For the unweighted case, the goal is to find the maximum number of ... -
An MLIR-Based High-Level Synthesis Compiler for Hardware Accelerator Design
The emergence of machine learning, image and audio processing on edge devices has motivated research towards power-efficient custom hardware accelerators. Though FPGAs are an ideal target for custom accelerators, the ... -
Novel Algorithms for Improving Agricultural Planning and Operations using Artificial Intelligence and Game Theory
This dissertation work is motivated by the critical need to address a perennial global problem, namely, how to mitigate the distress of the small and marginal agricultural farmers in emerging economies. Key reasons behind ... -
Privadome: A System for Citizen Privacy in the Delivery Drone Era
E-commerce companies are actively considering the use of delivery drones for customer fulfillment, leading to growing concerns around citizen privacy. Drones are equipped with cameras, and the video feed from these cameras ... -
Secure Computation Protocol Suite for Privacy-Conscious Applications
As an alternative to performing analytics in the clear, there is an increasing demand for developing privacy-preserving solutions that aim to protect sensitive data while still allowing for its efficient analysis. Among ... -
Specification Synthesis with Constrained Horn Clauses
Many practical problems in software development, verification and testing rely on specifications. The problem of specification synthesis is to automatically find relational constraints for undefined functions, called ... -
Temporal Point Processes for Forecasting Events in Higher-Order Networks
Real-world systems consisting of interacting entities can be effectively represented as time-evolving networks or graphs, where the entities are depicted as nodes, and the interactions between them are represented as ... -
Topological Structures and Operators for Bivariate Data Visualization
Understanding complex phenomena in diverse scientific and engineering disciplines often relies on decoding the interplay among real-valued or scalar fields that are measured or computed over a spatial domain. This thesis ... -
Towards Robustness of Neural Legal Judgement System
Legal Judgment Prediction (LJP) implements Natural Language Processing (NLP) techniques to predict judgment results based on fact description. It can play a vital role as a legal assistant and benefit legal practitioners ...