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

    Browsing Computer Science and Automation (CSA) by Title

    • 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 307-326 of 394

    • title
    • xmlui.ArtifactBrowser.ConfigurableBrowse.sort_by.datesubmitted
    • issue date
    • ascending
    • descending
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
      • Problems on bend-number, circular separation dimension and maximum edge 2-colouring 

        Lahiri, Abhiruk
        Representation of graphs as the intersection graphs of geometric objects has a long history. The objective is to a nd a collection of \simple" sets S such that a given graph G is its intersection graph. We are interested ...
      • Procurement Network Formation : A Cooperative Game Theoretic Approach 

        Chandrashekar, T S (2009-04-16)
        Complex economic activity often involves inter-relationships at several levels of production, often referred to as supply chains or procurement networks. In this thesis we address the problem of forming procurement networks ...
      • Program Analyses to Support Memory-saving Refactorings in Java Programs 

        Rama, Girish Maskeri
        Software commonly consumes unexpectedly high amounts of memory, frequently due to programming idioms that are used to make software more reliable, maintainable and understandable. In the case of modern object-oriented ...
      • Program Repair by Automated Generation of Hints 

        Kaleeswaran, Shalini
        Programming has become an important skill in today's technology-driven world. It is a complex activity because of which programmers make mistakes in their software. Student programmers make mistakes in their programs due ...
      • Prolog Technology For Temporal Reasoning In Relational Databases 

        Suresh Babu, V S S (2012-05-03)
      • Provable Methods for Non-negative Matrix Factorization 

        Pani, Jagdeep (2017-10-31)
        Nonnegative matrix factorization (NMF) is an important data-analysis problem which concerns factoring a given d n matrix A with nonnegative entries into matrices B and C where B and C are d k and k n with nonnegative ...
      • PyGraph: Compiler Support for Efficient and Transparent Use of CUDA Graphs 

        Ghosh, Abhishek
        CUDA Graphs --- a recent hardware feature introduced for NVIDIA GPUs --- aim to reduce CPU launch overhead by capturing and launching a series of GPU tasks (kernels) as a DAG. However, deploying CUDA Graphs faces several ...
      • Quantum-Safe Identity-Based Signature Scheme in Multivariate Quadratic Setting 

        Dimri, Akansha
        Cryptographic techniques are essential for the security of communication in modern society. Today, nearly all public key cryptographic schemes used in practice are based on the two problems of factoring large integers and ...
      • Rainbow Colouring and Some Dimensional Problems in Graph Theory 

        Rajendraprasad, Deepak (2018-04-05)
        This thesis touches three different topics in graph theory, namely, rainbow colouring, product dimension and boxicity. Rainbow colouring An edge colouring of a graph is called a rainbow colouring, if every pair of vertices ...
      • Rainbow Connection Number Of Graph Power And Graph Products 

        Arunselvan, R (2014-09-09)
        The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. ...
      • Ranking from Pairwise Comparisons : The Role of the Pairwise Preference Matrix 

        Rajkumar, Arun (2018-07-05)
        Ranking a set of candidates or items from pair-wise comparisons is a fundamental problem that arises in many settings such as elections, recommendation systems, sports team rankings, document rankings and so on. Indeed it ...
      • Rational Secure Computation: New Definitions and Constructions 

        Agarwal, Siddharth
        Cryptography and Game Theory are two fascinating areas of modern computing, and there have been numerous works since the early 2000s to bridge these. While cryptography provides mechanisms to detect deviations, game theory ...
      • Reasoning about Safety of Camera-Based Neural Network Controlled Systems 

        Habeeb, P
        Autonomous technologies are becoming increasingly prevalent due to the numerous benefits they offer, including improved safety and security, enhanced accessibility for mobility-challenged individuals, and the ability to ...
      • Recommendations in Complex Networks: Unifying Structure into Random Walk 

        Nandanwar, Sharad
        Making recommendations or predicting links which are likely to exist in the future is one of the central problems in network science and graph mining. In spite of modern state-of- the-art approaches for link prediction, ...
      • Reconstruction of 3D Neuronal Structures 

        Kumar, Kanuj (2018-03-17)
        Microscopic analysis of biological structures can be significantly enhanced by representing the object of study as a three-dimensional entity. To assist neurobiologists investigate the molecular mechanisms involved in ...
      • Recovery Algorithms for planted structures in Semi-random models 

        Paul, Rameesh
        For many NP-hard problems, the analysis of best-known approximation algorithms yields “poor” worst-case guarantees. However, using various heuristics, the problems can be solved (to some extent) in real-life instances. ...
      • Recovery From DoS Attacks In MIPv6 : Modelling And Validation 

        Kumar, Manish C (2010-07-26)
        Denial-of-Service (DoS) attacks form a very important category of security threats that are possible in MIPv6 (Mobile Internet Protocol version 6). This thesis proposes a scheme for participants (Mobile Node, Home Agent, ...
      • Reeb Graphs : Computation, Visualization and Applications 

        Harish, D (2018-02-23)
        Level sets are extensively used for the visualization of scalar fields. The Reeb graph of a scalar function tracks the evolution of the topology of its level sets. It is obtained by mapping each connected component of a ...
      • A Refinement-Based Methodology for Verifying Abstract Data Type Implementations 

        Divakaran, Sumesh (2018-06-21)
        This thesis is about techniques for proving the functional correctness of Abstract Data Type (ADT) implementations. We provide a framework for proving the functional correctness of imperative language implementations of ...
      • 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 ...

        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