• Login
    Browsing Computer Science and Automation (CSA) by thesis submitted date 
    •   etd@IISc
    • Division of Electrical, Electronics, and Computer Science (EECS)
    • Computer Science and Automation (CSA)
    • Browsing Computer Science and Automation (CSA) by thesis submitted date
    •   etd@IISc
    • Division of Electrical, Electronics, and Computer Science (EECS)
    • Computer Science and Automation (CSA)
    • Browsing Computer Science and Automation (CSA) by thesis submitted date
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browsing Computer Science and Automation (CSA) by thesis submitted date"2022"

    • 0-9
    • A
    • B
    • C
    • D
    • E
    • F
    • G
    • H
    • I
    • J
    • K
    • L
    • M
    • N
    • O
    • P
    • Q
    • R
    • S
    • T
    • U
    • V
    • W
    • X
    • Y
    • Z

    Sort by:

    Order:

    Results:

    Now showing items 1-20 of 21

    • title
    • xmlui.ArtifactBrowser.ConfigurableBrowse.sort_by.datesubmitted
    • issue date
    • ascending
    • descending
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
      • 2-Level Page Tables (2-LPT): A Building Block for Efficient Address Translation in Virtualized Environments 

        Baviskar, Akshay Suresh
        Efficient address translation mechanisms are gaining more and more attention as the virtual address range of the processors keeps expanding and the demand for machine virtualization increases with cloud and data center-based ...
      • Achieving practical secure non-volatile memory system with in-Memory Integrity Verification (iMIV) 

        Jain, Rajat
        Recent commercialization of Non-Volatile Memory (NVM) technology in the form of Intel Optane enables programmers to write recoverable programs. However, the data on NVM is susceptible to a plethora of data remanence attacks, ...
      • Boolean Functional Synthesis using Gated Continuous Logic Networks 

        Raja, Ravi
        Boolean Functional Synthesis (BFS) is a well-known challenging problem in the domain of automated program synthesis from logical specifications. This problem aims to synthesize a Boolean function that is correct-by-construction ...
      • Comparative Analysis of Topological Structures 

        Raghavendra, G S
        Measuring scientific processes result in a set of scalar functions (scalar fields) which may be related temporally, be part of an ensemble, or unrelated. Overall understanding and visualization of scientific processes ...
      • A Context-Aware Neural Approach for Explainable Citation Link Prediction 

        Jain, Soumya
        Citations have become an integral part of scientific publications. They play a crucial role in supporting authors’ claims throughout a scientific paper. However, citing related work is a challenging and laborious task, ...
      • An Evaluation of Basic Protection Mechanisms in Financial Apps on Mobile Devices 

        Agrawal, Nikhil
        This thesis concerns the robustness of security checks in financial mobile applications (or simply financial apps). The best practices recommended by OWASP for developing such apps demand that developers include several ...
      • Explainable and Efficient Neural Models for Natural Language to Bash Command Translation 

        Bharadwaj, Shikhar
        One of the key goals of Natural Language Processing is to make computers understand natural language. Semantic Parsing has been one of the driving tasks for Natural Language Understanding. It is formally defined as the ...
      • Fast Algorithms for Max Cut on Geometric Intersection Graphs 

        Joshi, Utkarsh
        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 ...
      • HYDRA: A Dynamic Approach to Database Regeneration 

        Sanghi, Anupam
        Database software vendors often need to generate synthetic databases for a variety of applications, including (a) Testing database engines and applications, (b) Data masking, (c) Benchmarking, (d) Creating what-if scenarios, ...
      • Improved Algorithms for Variants of Bin Packing and Knapsack 

        Karnati, Venkata Naga Sreenivasulu
        We study variants of two classical optimization problems: Bin Packing and Knapsack. Both bin packing and knapsack fall under the regime of "Packing and Covering Problems". In bin packing, we are given a set of input items, ...
      • Inducing Constraints in Paraphrase Generation and Consistency in Paraphrase Detection 

        Kumar, Ashutosh
        Deep learning models typically require a large volume of data. Manual curation of datasets is time-consuming and limited by imagination. As a result, natural language generation (NLG) has been employed to automate the ...
      • Learning Invariants for Verification of Programs and Control Systems 

        Ezudheen, P
        Deductive verification techniques in the style of Floyd and Hoare have the potential to give us concise, compositional, and scalable proofs of the correctness of various kinds of software systems like programs and control ...
      • Model-based Safe Deep Reinforcement Learning and Empirical Analysis of Safety via Attribution 

        Jayant, Ashish
        During initial iterations of training in most Reinforcement Learning (RL) algorithms, agents perform a significant number of random exploratory steps, which in the real-world limit the practicality of these algorithms ...
      • Multi-Armed Bandits – On Range Searching and On Slowly-varying Non-stationarity 

        Ramakrishnan, K
        Multi-Armed Bandits (MAB) is a popular framework for modelling sequential decision-making problems under uncertainty. This thesis is a compilation of two independent works on MABs. 1. In the first work, we study a ...
      • Neural Approaches for Natural Language Query Answering over Source Code 

        Mandal, Madhurima
        During software development, developers need to ensure that the developed code is bug-free and the best coding practices are followed during the code development process. To guarantee this, the developers require answers ...
      • On symmetries of and equivalence tests for two polynomial families and a circuit class 

        Gupta, Nikhil
        Two polynomials f, g ∈ F[x1, . . . , xn] over a field F are said to be equivalent if there exists an n×n invertible matrix A over F such that g = f(Ax), where x = (x1 · · · xn)T . The equivalence test (in short, ET) for ...
      • Operating System Support for Efficient Virtual Memory 

        Panwar, Ashish
        Computers rely on the virtual memory abstraction to simplify programming, portability, physical memory management and ensure isolation among co-running applications. However, it creates a layer of indirection in the ...
      • Performance Characterization and Optimizations of Traditional ML Applications 

        Kumar, Harsh
        Even in the era of Deep Learning based methods, traditional machine learning methods with large data sets continue to attract significant attention. However, we find an apparent lack of a detailed performance characterization ...
      • Reinforcement Learning Algorithms for Off-Policy, Multi-Agent Learning and Applications to Smart Grids 

        Diddigi, Raghuram Bharadwaj
        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 ...
      • Stochastic Optimization And Its Application In Reinforcement Learning 

        Mondal, Akash
        Numerous engineering fields, such as transportation systems, manufacturing, communication networks, healthcare, and finance, frequently encounter problems requiring optimization in the presence of uncertainty. Simulation-based ...

        etd@IISc is a joint service of SERC & J R D Tata Memorial (JRDTML) Library || Powered by DSpace software || DuraSpace
        Contact Us | Send Feedback | Thesis Templates
        Theme by 
        Atmire NV
         

         

        Browse

        All of etd@IIScCommunities & CollectionsTitlesAuthorsAdvisorsSubjectsBy Thesis Submission DateThis CollectionTitlesAuthorsAdvisorsSubjectsBy Thesis Submission Date

        My Account

        LoginRegister

        etd@IISc is a joint service of SERC & J R D Tata Memorial (JRDTML) Library || Powered by DSpace software || DuraSpace
        Contact Us | Send Feedback | Thesis Templates
        Theme by 
        Atmire NV