• Login
    View Item 
    •   DSpace Home
    • ASME
    • Journal of Dynamic Systems, Measurement, and Control
    • View Item
    •   DSpace Home
    • ASME
    • Journal of Dynamic Systems, Measurement, and Control
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A Polynomial-Time Algorithm for Efficient Extraction of Boundary Rectangles From Interval Templates

    Thumbnail
    View/Open
    JDSMAA-26325#654_1.pdf (85.96Kb)
    Date
    2003
    Author
    P. S. V. Nataraj
    R. Satyanarayan
    S. Sheela
    Metadata
    Show full item record
    Abstract
    A polynomial-time O(n2) algorithm is presented for extracting the boundary rectangles from a given interval template having no “inner windings.” The algorithm involves only comparisons and list operations. The performance of the algorithm is tested and compared with those of four boundary extraction algorithms existing in the QFT literature. The testing is done on a benchmark suite of eleven transfer function examples, using computational time and effort (flops) as the performance metrics. The test results show the proposed algorithm to be superior in every example. The typical improvement in terms of these metrics is by several orders of magnitude.
    URI
    http://yetl.yabesh.ir/yetl/handle/yetl/128099
    Collections
    • Journal of Dynamic Systems, Measurement, and Control

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV