• 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 50-69 of 393

    • title
    • xmlui.ArtifactBrowser.ConfigurableBrowse.sort_by.datesubmitted
    • issue date
    • ascending
    • descending
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
      • Bandit Algorithms: Fairness, Welfare, and Applications in Causal Inference 

        Sawarni, Ayush
        We study regret in online learning from a welfarist perspective and explore an application of bandit algorithms in causal inference. We introduce Nash regret, which measures the difference between the optimal action ...
      • Barrier Function Inspired Reward Shaping in Reinforcement Learning 

        Ranjan, Abhishek
        Reinforcement Learning (RL) has progressed from simple control tasks to complex real-world challenges with large state spaces. During initial iterations of training in most Reinforcement Learning (RL) algorithms, agents ...
      • Battle of Bandits: Online Learning from Subsetwise Preferences and Other Structured Feedback 

        Saha, Aadirupa
        The elicitation and aggregation of preferences is often the key to making better decisions. Be it a perfume company wanting to relaunch their 5 most popular fragrances, a movie recommender system trying to rank the most ...
      • Bayes Optimal Feature Selection for Supervised Learning 

        Saneem Ahmed, C G (2018-02-18)
        The problem of feature selection is critical in several areas of machine learning and data analysis such as, for example, cancer classification using gene expression data, text categorization, etc. In this work, we consider ...
      • Bayesian Nonparametric Modeling of Temporal Coherence for Entity-Driven Video Analytics 

        Mitra, Adway (2018-05-14)
        In recent times there has been an explosion of online user-generated video content. This has generated significant research interest in video analytics. Human users understand videos based on high-level semantic ...
      • 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 ...
      • Bounds On Augmented Automata And Quantum Adiabatic Optimization 

        Rao, M V Panduranga (2009-05-25)
        Quantum computing has generated a lot of interested in the past two decades. Research into powerful models of quantum computation has yielded important and elegant results like an efficient algorithm for factoring and a ...
      • Boxicity And Cubicity : A Study On Special Classes Of Graphs 

        Mathew, Rogers (2014-06-02)
        Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping f : V (G)→ F such that, An interval graph is an intersection graph of a family of closed intervals on the ...
      • Boxicity, Cubicity And Vertex Cover 

        Shah, Chintan D (2010-09-28)
        The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding ...
      • A Broadcast Cube-Based Multiprocessor Architecture for Solving Partial Differential Equations 

        Murthy, Siva Ram C (Indian Institute of Science, 2005-01-26)
        A large number of mathematical models in engineering and physical sciences employ Partial Differential Equations (PDEs). The sheer number of operations required in numerically integrating PDEs in these applications has ...
      • Caching Strategies And Design Issues In CD-ROM Based Multimedia Storage 

        Shastri, Vijnan (2012-11-20)
      • Caching Techniques For Dynamic Web Servers 

        Suresha, * (2009-03-20)
        Websites are shifting from static model to dynamic model, in order to deliver their users with dynamic, interactive, and personalized experiences. However, dynamic content generation comes at a cost – each request ...
      • A Case for Protecting Huge Pages from the Kernel 

        Patel, Naman (2018-01-01)
        Modern architectures support multiple size pages to facilitate applications that use large chunks of contiguous memory either for buffer allocation, application specific memory management, in-memory caching or garbage ...
      • Characterizing The Vulnerability Of Parallelism To Resource Constraints 

        Vivekanand, V (2012-05-09)
      • Checking Compatability of Programs on Shared Data 

        Pranavadatta, DN (2018-07-28)
        A large software system is built by composing multiple programs, possibly developed independently. The component programs communicate by sharing data. Data sharing involves creation of instances of the shared data by one ...
      • Checking Observational Purity of Procedures 

        Arora, Himanshu
        We provide two static analysis approaches(using theorem proving) that check if a given (recursive) procedure behaves as if it were stateless, even when it maintains state in global variables. In other words, we check if ...
      • CLUSTER AND COLLECT : Compile Time Optimization For Effective Garbage Collection 

        Ravindar, Archana (2011-09-26)
      • Cluster Identification : Topic Models, Matrix Factorization And Concept Association Networks 

        Arun, R (2013-09-17)
        The problem of identifying clusters arising in the context of topic models and related approaches is important in the area of machine learning. The problem concerning traversals on Concept Association Networks is of great ...
      • CodeQueries: Benchmarking Query Answering over Source Code 

        Sahu, Surya Prakash
        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 ...
      • Combinatorial Problems arising in Quantum Physics and Model counting 

        Reddy, Rishikesh G S M
        This thesis investigates some combinatorial problems arising in quantum physics and model counting. In particular, we develop new graph-theoretic techniques to resolve some open questions from quantum photonics. We also ...

        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