• 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"2012"

    • 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-17 of 17

    • title
    • xmlui.ArtifactBrowser.ConfigurableBrowse.sort_by.datesubmitted
    • issue date
    • ascending
    • descending
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
      • Access Path Based Dataflow Analysis For Sequential And Concurrent Programs 

        Arnab De, * (2016-09-14)
        In this thesis, we have developed a flow-sensitive data flow analysis framework for value set analyses for Java-like languages. Our analysis frame work is based on access paths—a variable followed by zero or more field ...
      • An Algorithmic Characterization Of Polynomial Functions Over Zpn 

        Guha, Ashwin (2014-07-04)
        The problem of polynomial representability of functions is central to many branches of mathematics. If the underlying set is a finite field, every function can be represented as a polynomial. In this thesis we consider ...
      • 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 ...
      • 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 ...
      • Design Of Truthful Allocation Mechanisms For Carbon Footprint Reduction 

        Udaya Lakshmi, L (2014-06-05)
        Global warming is currently a major challenge faced by the world. Reduction of carbon emissions is of paramount importance in the context of global warming. There are widespread ongoing efforts to find satisfactory ways ...
      • Efficient Usage Of Flash Memories In High Performance Scenarios 

        Srimugunthan, * (2016-09-09)
        New PCI-e flash cards and SSDs supporting over 100,000 IOPs are now available, with several usecases in the design of a high performance storage system. By using an array of flash chips, arranged in multiple banks, large ...
      • Graph Models For Query Focused Text Summarization And Assessment Of Machine Translation Using Stopwords 

        Rama, B (2014-04-09)
        Text summarization is the task of generating a shortened version of the original text where core ideas of the original text are retained. In this work, we focus on query focused summarization. The task is to generate the ...
      • Learning Robust Support Vector Machine Classifiers With Uncertain Observations 

        Bhadra, Sahely (2015-08-19)
        The central theme of the thesis is to study linear and non linear SVM formulations in the presence of uncertain observations. The main contribution of this thesis is to derive robust classfiers from partial knowledge of ...
      • Online Learning and Simulation Based Algorithms for Stochastic Optimization 

        Lakshmanan, K (2018-03-07)
        In many optimization problems, the relationship between the objective and parameters is not known. The objective function itself may be stochastic such as a long-run average over some random cost samples. In such cases ...
      • Parameterized Complexity of Maximum Edge Coloring in Graphs 

        Goyal, Prachi (2018-03-09)
        The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent edges in the graph, get the same color in the proposed coloring. In the following ...
      • 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 ...
      • Reliability Modelling Of Whole RAID Storage Subsystems 

        Karmakar, Prasenjit (2014-06-05)
        Reliability modelling of RAID storage systems with its various components such as RAID controllers, enclosures, expanders, interconnects and disks is important from a storage system designer's point of view. A model that ...
      • Scaling Context-Sensitive Points-To Analysis 

        Nasre, Rupesh (2014-05-06)
        Pointer analysis is one of the key static analyses during compilation. The efficiency of several compiler optimizations and transformations depends directly on the scalability and precision of the underlying pointer analysis. ...
      • Sentiment-Driven Topic Analysis Of Song Lyrics 

        Sharma, Govind (2015-08-17)
        Sentiment Analysis is an area of Computer Science that deals with the impact a document makes on a user. The very field is further sub-divided into Opinion Mining and Emotion Analysis, the latter of which is the basis for ...
      • Studies In Automatic Management Of Storage Systems 

        Pipada, Pankaj (2015-11-16)
        Autonomic management is important in storage systems and the space of autonomics in storage systems is vast. Such autonomic management systems can employ a variety of techniques depending upon the specific problem. In this ...
      • A Systems Perspective of Software Runtime Bloat - Origin, Mitigation and Power-Performance Implications 

        Bhattacharya, Suparna (2018-03-08)
        Large flexible software systems tend to incur “bloat”, here defined as the runtime overhead induced by the accumulation of excess functionality and objects. Removing bloat is hard as these overheads are a side-effect of ...
      • Weighted Average Based Clock Synchronization Protocols For Wireless Sensor Networks 

        Swain, Amulya Ratna (2016-07-12)
        Wireless Sensor Networks (WSNs) consist of a large number of resource constrained sensor nodes equipped with various sensing devices which can monitor events in the real world. There are various applications such as ...

        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