• 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 246-265 of 351

    • title
    • xmlui.ArtifactBrowser.ConfigurableBrowse.sort_by.datesubmitted
    • issue date
    • ascending
    • descending
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
      • On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem 

        Vivek, Srinivas V (2013-05-21)
        There has been a rapid increase interest in computational number theory ever since the invention of public-key cryptography. Various attempts to solve the underlying hard problems behind public-key cryptosystems has led ...
      • On Dimensional Parameters Of Graphs And Posets 

        Adiga, Abhijin (2013-06-21)
        In this thesis we study the following dimensional parameters : boxicity, cubicity, threshold dimension and poset dimension. While the first three parameters are defined on graphs, poset dimension is defined on partially ...
      • On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions 

        Dukkipati, Ambedkar (2008-01-29)
        Kullback-Leibler relative-entropy or KL-entropy of P with respect to R defined as ∫xlnddPRdP , where P and R are probability measures on a measurable space (X, ), plays a basic role in the definitions of classical information ...
      • On Learning and Lower Bound Problems Related to the Iterated Matrix Multiplication Polynomial 

        Nair, Vineet
        The iterated matrix multiplication polynomial (IMM) of width w and length d is the 1x1 entry in the product of d square matrices of size w. The w^2d entries in the d matrices are distinct variables. In this thesis, we study ...
      • On Learning k-Parities and the Complexity of k-Vector-SUM 

        Gadekar, Ameet (2018-02-06)
        In this work, we study two problems: first is one of the central problem in learning theory of learning sparse parities and the other k-Vector-SUM is an extension of the not oriousk-SUM problem. We first consider the problem ...
      • On symmetries of and equivalence tests for two polynomial families and a circuit class 

        Gupta, Nikhil
        Two polynomials f, g ∈ F[x1, . . . , xn] over a field F are said to be equivalent if there exists an n×n invertible matrix A over F such that g = f(Ax), where x = (x1 · · · xn)T . The equivalence test (in short, ET) for ...
      • On The Complexity Of Grobner Basis And Border Basis Detection 

        Prabhanjan, V A (2013-06-14)
        The theory of Grobner bases has garnered the interests of a large number of researchers in computational algebra due to its applications not only in mathematics but also in areas like control systems, robotics, cryptography ...
      • On the Round Complexity Landscape of Secure Multi-party Computation 

        Ravi, Divya
        In secure multi-party computation (MPC), n parties wish to jointly perform a computation on their private inputs in a secure way, so that no adversary corrupting a subset of the parties can learn more information than their ...
      • 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 ...
      • Online Optimization Of RED Routers 

        Vaidya, Rahul (2011-04-25)
      • Operating System Support for Efficient Virtual Memory 

        Panwar, Ashish
        Computers rely on the virtual memory abstraction to simplify programming, portability, physical memory management and ensure isolation among co-running applications. However, it creates a layer of indirection in the ...
      • Operating System Support For Optimistic Distributed Simulation 

        Raja, V (2013-07-24)
      • Optimization Algorithms for Deterministic, Stochastic and Reinforcement Learning Settings 

        Joseph, Ajin George (2018-05-30)
        Optimization is a very important field with diverse applications in physical, social and biological sciences and in various areas of engineering. It appears widely in ma-chine learning, information retrieval, regression, ...
      • Optimizations In Storage Area Networks And Direct Attached Storage 

        Dharmadeep, M C (2009-07-23)
        The thesis consists of three parts. In the first part, we introduce the notion of device-cache-aware schedulers. Modern disk subsystems have many megabytes of memory for various purposes such as prefetching and caching. ...
      • An Optimizing Code Generator for a Class of Lattice-Boltzmann Computations 

        Pananilath, Irshad Muhammed (2018-03-09)
        Lattice-Boltzmann method(LBM), a promising new particle-based simulation technique for complex and multiscale fluid flows, has seen tremendous adoption in recent years in computational fluid dynamics. Even with a ...
      • Optimizing Dense Matrix Computations with PolyMage 

        Kumudha, K N
        Linear algebra computations and other arbitrary affine accesses are ubiquitous in applications from domains like scientific computing, digital signal processing (DSP), and deep neural networks. Libraries such as OpenBLAS, ...
      • Outlier Detection with Applications in Graph Data Mining 

        Ranga Suri, N N R (2018-04-24)
        Outlier detection is an important data mining task due to its applicability in many contemporary applications such as fraud detection and anomaly detection in networks, etc. It assumes significance due to the general ...
      • P3 : An Effective Technique for Partitioned Path Profiling 

        Afraz, Mohammed
        Acyclic path profile is an abstraction of dynamic control flow paths of procedures and has been found to be useful in a wide spectrum of activities. Unfortunately, the runtime overhead of obtaining such a profile can be ...
      • A Parallelizing Compiler for Fortran 

        Janaki, S (Indian Institute of Science, 2005-03-09)
        With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the work of a programmer these systems. Data parallel languages like Fortran D, Vienna Fortran, High Performance Fortran and ...
      • 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 ...

        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