• 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 21-40 of 394

    • title
    • xmlui.ArtifactBrowser.ConfigurableBrowse.sort_by.datesubmitted
    • issue date
    • ascending
    • descending
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
      • Algorithms for Geometric Packing and Covering Problems 

        Lonkar, Aditya Abhay
        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, ...
      • Algorithms for Multilingual IR in Low Resource Languages using Weakly Aligned Corpora 

        Tholpadi, Goutham
        Multilingual information retrieval (MLIR) methods generally rely on linguistic resources such as dictionaries, parallel corpora, etc., to overcome the language barrier. For low resource languages without these resources, ...
      • Algorithms For Piecewise Linear Knapsack Problems With Applications In Electronic Commerce 

        Kameshwaran, S (2011-04-19)
      • Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks 

        Sindhu, P R (2018-05-09)
        In this thesis, we consider stochastic systems which arise in different real-world application contexts. The first problem we consider is based on product adoption and pricing. A monopolist selling a product has to appropriately ...
      • Algorithms For Profiling And Representing Programs With Applications To Speculative Optimizations 

        Roy, Subhajit (2013-09-17)
      • Algorithms for Social Good in Online Platforms with Guarantees on Honest Participation and Fairness 

        Ghalme, Ganesh Sambhaji
        Recent decades have seen a revolution in the way people communicate, buy products, learn new things, and share life experiences. This has spurred the growth of online platforms that enable users from all over the globe to ...
      • Algorithms For Stochastic Games And Service Systems 

        Prasad, H L (2014-04-23)
        This thesis is organized into two parts, one for my main area of research in the field of stochastic games, and the other for my contributions in the area of service systems. We first provide an abstract for my work in ...
      • Algorithms for Stochastic Optimization, Statistical Estimation and Markov Decision Processes 

        Kamanchi, Chandramouli
        Stochastic approximation deals with the problem of finding zeros of a function expressed as an expectation of a random variable. In this thesis we propose convergent algorithms for problems in optimization, statistical ...
      • Algorithms for various cost criteria in Reinforcement Learning 

        Guin, Soumyajit
        In this thesis we will look at various Reinforcement Learning algorithms. We will look at algorithms for various cost criteria or reward objectives namely Finite Horizon, Discounted Cost, Risk-Sensitive Cost. For Finite ...
      • Algortihms for Individual and Collective Fairness Measures 

        Krishna, Anand
        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 ...
      • Analysing Message Sequence Graph Specifications 

        Chakraborty, Joy (2011-03-29)
        Message Sequence Charts are a visual representation of the system specification which shows how all the participating processes are interacting with each other. Message Sequence Graphs provide modularity by easily allowing ...
      • Analysis And Design Of Image And Video Encryption Algorithms 

        Yekkala, Anil Kumar (2009-03-19)
        The rapid growth in multimedia based Internet systems and applications like video telephony, video on demand, network based DVD recorders and IP television has created a substantial need for ...
      • Analysis and Methods for Knowledge Graph Embeddings 

        Chandrahas
        Knowledge Graphs (KGs) are multi-relational graphs where nodes represent entities, and typed edges represent relationships among entities. These graphs store real-world facts such as (Lionel Messi, plays-for-team, Barcelona) ...
      • Analysis And Optimization Of Queueing Models With Markov Modulated Poisson Input 

        Hemachandra, Nandyala (2012-05-02)
      • Analysis Of A Sieving Heuristic For The Number Field Sieve And Design Of Low-Correlation CDMA Sequences 

        Garg, Gagan (2011-01-25)
        In this thesis, we investigate in detail, certain important problems in cryptography and coding theory. In the first part of this thesis, we discuss the number field sieve and compare the two ways in which the sieving ...
      • Analysis, Design, and Acceleration of DNN Training Preprocessing Pipelines 

        Jha, Keshav Vinayak
        The performance of deep neural network (DNN) training is a function of both the training compute latency and the latency to fetch and preprocess the input data needed to train the model. With advance- ments in GPUs and ...
      • Ankora: Notions of Multi-party Computation and Zero-knowledge Beyond Conventional Models 

        Paul, Protik Kumar
        In the era of digitalization, data privacy and integrity are of utmost importance. Secure multiparty computation (MPC) and zero-knowledge (ZK) facilitate data privacy and integrity. MPC enables privacy-preserving collaborative ...
      • Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application 

        Lakshminarayanan, Chandrashekar (2018-08-13)
        Problems involving optimal sequential making in uncertain dynamic systems arise in domains such as engineering, science and economics. Such problems can often be cast in the framework of Markov Decision Process (MDP). ...
      • Approximation Algorithms for Geometric Packing and Covering Problems 

        Roy, Aniket Basu
        We study a host of geometric optimization problems that are NP-hard and design polynomial time approximation algorithms for them. More precisely, we are given a family of geometric objects and a point set, mostly in the ...
      • Approximation Algorithms for Geometric Packing Problems 

        Sharma, Eklavya
        We study approximation algorithms for the geometric bin packing problem and its variants. In the two-dimensional geometric bin packing problem (2D GBP), we are given n rectangular items and we have to compute an axis-parallel ...

        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