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

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 11-15 of 15

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100

    Time Management In Partitioned Systems 

    Kodancha, A Hariprasad (2010-02-11)
    Time management is one of the critical modules of safety-critical systems. Applications need strong assurance from the operating system that their hard real-time requirements are met. Partitioned system has recently evolved ...

    Learning Algorithms Using Chance-Constrained Programs 

    Jagarlapudi, Saketha Nath (2010-07-08)
    This thesis explores Chance-Constrained Programming (CCP) in the context of learning. It is shown that chance-constraint approaches lead to improved algorithms for three important learning problems — classification with ...

    Semi-Supervised Classification Using Gaussian Processes 

    Patel, Amrish (2010-03-26)
    Gaussian Processes (GPs) are promising Bayesian methods for classification and regression problems. They have also been used for semi-supervised classification tasks. In this thesis, we propose new algorithms for solving ...

    Efficient Compilation Of Stream Programs Onto Multi-cores With Accelerators 

    Udupa, Abhishek (2010-12-30)
    Over the past two decades, microprocessor manufacturers have typically relied on wider issue widths and deeper pipelines to obtain performance improvements for single threaded applications. However, in the recent years, ...

    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 ...
    • 1
    • 2

    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

    Discover

    AuthorAbdulla, Mohammed Shahid (1)Bharadwaj, Subramanya B V (1)Bhattacharya, Sourangshu (1)Chakrabarti, Sujit Kumar (1)Gopinathan, Madhu (1)Jagarlapudi, Saketha Nath (1)Jindal, Prachee (1)Kodancha, A Hariprasad (1)Kumar, Manish C (1)Nagpal, Rahul (1)... View MoreSubjectComputer Science (12)Algorithms (2)Classification - Algorithms (2)Energy Optimization (2)Machine Learning (2)Accelerators (1)Algorithms (Computer Science) (1)API Libraries - Regression Testing (1)Application Programming Interface (1)ARINC-653 (1)... View MoreDate Issued
    2010 (15)
    Has File(s)
    Yes (15)

    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