• Login
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Discover

    AuthorAgarwal, Shivani (1)Banda, Kishore Kumar (1)Bhatia, Atul (1)Christian, Ruzvelt (1)Doshi, Nishant (1)Gupta, Dhruv (1)Jain, Shubham (1)Kulkarni, Rucha (1)Kumar, Lokesh (1)Lodha, Pratik (1)... View MoreSubject
    Algorithms (24)
    Computational complexity (4)Graph theory (4)Computer algorithms (3)Paths and cycles (3)Auxiliary graph (2)Computer science (2)Data processing (2)Data structures (2)Digital techniques (2)... View MoreDate Issued2020 - 2022 (3)2010 - 2019 (11)2004 - 2009 (10)Has File(s)Yes (18)No (6)

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 1-10 of 24

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

    Spectral estimation using WRLS algorithm for multiband detection 

    Bhatia, Atul (Dhirubhai Ambani Institute of Information and Communication Technology, 2008)
    Signal parameter estimation in the presence of noise has been a key area of research. Many applications have benefited from advancements made in this field within the last two decades. The method proposed in the thesis ...
    Thumbnail

    Path complexity of maximum segment sum problem 

    Mishra, Devesh (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
    Various software complexity metrics have been proposed in literature. A program complexity measure called path complexity is proposed in [1]. Path complexity P(A,n) of an algorithm A is defined to be the number of program ...
    Thumbnail

    Acyclic edge coloring of complete r-partite graphs 

    Teja, V. Krishna (Dhirubhai Ambani Institute of Information and Communication Technology, 2011)
    An acyclic edge coloring of a graph G is a proper edge coloring of G which has no dichromatic cycle. The minimum number of colors required to acyclically edge color graph G is called its acyclic chromatic index, denoted ...
    Thumbnail

    Localization for a habitat monitoring sensor network for ground turtles 

    Jain, Shubham (Dhirubhai Ambani Institute of Information and Communication Technology, 2007)
    This thesis work deals with the localization problem (i.e. finding the location of the sensor nodes) in sensor networks. This work is specifically concerned with the localization of the sensor nodes on small ground turtles ...
    Thumbnail

    Embedding binary trees and caterpillars into the hypercube 

    Srivastava, Abhishek (Dhirubhai Ambani Institute of Information and Communication Technology, 2008)
    Embedding graphs is an important and well-studied theory in parallel computing. Finding the embedding of trees into hypercubes is an important, interesting and difficult problem. This work studies the embedding of binary ...
    Thumbnail

    On path complexities of heapsort algorithm and the class stack 

    Mangal, Anupam (Dhirubhai Ambani Institute of Information and Communication Technology, 2007)
    A measure of program complexity, called Path Complexity, based on the number of program execution paths as a function of the input size n, is proposed in [AJ05]. This measure can be used to compare the complexity of two ...
    Thumbnail

    Improved algorithms for modular multiplication and its application to block cipher RC6 

    Agarwal, Shivani (Dhirubhai Ambani Institute of Information and Communication Technology, 2004)
    This thesis explores the area of hardware implementation of block ciphers. An al¬gorithm for modular multiplication is proposed which is efficient in terms of speed and area. To demonstrate the effectiveness of the algorithm ...
    Thumbnail

    GPU-accelerated method of moments 

    Soni, Pushtivardhan (Dhirubhai Ambani Institute of Information and Communication Technology, 2015)
    This work considers the use of commodity graphics processing units (GPUs) for accelerating run-time critical phase of method of moments (MoM) which is a widely used computational electromagnetic (CEM) technique for solving ...
    Thumbnail

    Path complexity of the class binary search tree 

    Doshi, Nishant (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
    Path complexity of a program is defined as the number of program execution paths as a function of input size n. This notion of program complexity has been extended to complexity of a class as follows. Class had data members ...
    Thumbnail

    Robust surface coverage using deterministic grid based deployment in wireless sensor networks 

    Kulkarni, Rucha (Dhirubhai Ambani Institute of Information and Communication Technology, 2010)
    The rapid progress in the field of wireless communication ans MEMS technology has made wireless sensor networks (WSN) possible. These networks may have low cost sensors deployed which are capable of sensing any activity ...
    • 1
    • 2
    • 3

    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     


    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV