• 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 49-68 of 351

    • title
    • xmlui.ArtifactBrowser.ConfigurableBrowse.sort_by.datesubmitted
    • issue date
    • ascending
    • descending
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
      • 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 ...
      • 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 ...
      • COMPASS - A Guide For Selection Of Compression Strategies For Embedded Processors 

        Menon, Sreejith K (2011-09-23)
      • Compilation of Graph Algorithms for Hybrid, Cross-Platform and Distributed Architectures 

        Patel, Parita (2018-07-09)
        1. Main Contributions made by the supplicant: This thesis proposes an Open Computing Language (OpenCL) framework to address the challenges of implementation of graph algorithms on parallel architectures and large scale ...
      • A Compiler and Symbolic Debugger for Occam 

        Chelliah, M (Indian Institute of Science, 2005-03-03)
        We have implemented Occam, a parallel programming language, on a uniprocessor machine (MC-68020 based HORIZON I11 running on UNIX system V.2) with simulated concurrency. Occam is a descendant of CSP with a few convenient ...
      • Compiler Assisted Energy Management For Sensor Network Nodes 

        Jindal, Prachee (2010-08-16)
        Emerging low power, embedded, wireless sensor devices are useful for wide range of applications, yet have very limited processing storage and especially energy resources. Sensor networks have a wide variety of applications ...
      • Compiler Techniques For Code Size And Power Reduction For Embedded Processors 

        Sarvani, V V N S (2011-04-28)
      • Compiler Transformations For Improving The Performance Of Software Transactional Memory 

        Mannarswamy, Sandya S (2013-03-27)
        Expressing synchronization using traditional lock based primitives has been found to be both error-prone and restrictive. Hence there has been considerable research work to develop scalable and programmer-friendly alternatives ...
      • Compiler-Assisted Energy Optimization For Clustered VLIW Processors 

        Nagpal, Rahul (2010-04-13)
        Clustered architecture processors are preferred for embedded systems because centralized register file architectures scale poorly in terms of clock rate, chip area, and power consumption. Although clustering helps by ...
      • Computational And Combinatorial Problems On Some Geometric Proximity Graphs 

        Khopkar, Abhijeet (2017-05-24)
        In this thesis, we focus on the study of computational and combinatorial problems on various geometric proximity graphs. Delaunay and Gabriel graphs are widely studied geometric proximity structures. These graphs have been ...
      • Computational Problems In Codes On Graphs 

        Krishnan, K Murali (2009-05-11)
        Two standard graph representations for linear codes are the Tanner graph and the tailbiting trellis. Such graph representations allow the decoding problem for a code to be phrased as a computational problem on the corresponding ...
      • Computational Protein Structure Analysis : Kernel And Spectral Methods 

        Bhattacharya, Sourangshu (2010-08-24)
        The focus of this thesis is to develop computational techniques for analysis of protein structures. We model protein structures as points in 3-dimensional space which in turn are modeled as weighted graphs. The problem of ...
      • Computing Contour Tress for 2D Piecewise Polynomial Functions 

        Nucha, Girijanandan
        Contour trees are extensively used in scalar field analysis. The contour tree is a data structure that tracks the evolution of level set topology in a scalar field. Scalar fields are typically available as samples at ...

        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