Showing 1 - 20 results of 26 for search '(((( complement new algorithm ) OR ( element tree algorithms ))) OR ( neural coding algorithm ))', query time: 0.14s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7

    Approximate XML structure validation based on document–grammar tree similarity by Tekli, Joe

    Published 2015
    “…Our approach exploits the concept of tree edit distance, introducing a novel edit distance recurrence and dedicated algorithms to effectively compare XML documents and grammar structures, modeled as ordered labeled trees. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  8. 8
  9. 9
  10. 10

    A new approach and faster exact methods for the maximum common subgraph problem by Abu-Khzam, Faisal N.

    Published 2017
    “…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  11. 11
  12. 12

    MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments by Hend Gedawy (23275984)

    Published 2022
    “…For MAESTRO, we build an integrated architecture that includes two new scheduling algorithms for assigning computing workloads to FemtoClouds. …”
  13. 13

    A novel technique for fast multiplication by Sait, Sadiq M.

    Published 2020
    “…In this paper we present the design of a new high-speed multiplication unit. The design is based on non-overlapped scanning of 3-bit ® elds of the multiplier. …”
    Get full text
    article
  14. 14
  15. 15

    A novel technique for fast multiplication by Sait, Sadiq M.

    Published 1995
    “…In this paper we present the design of a new high speed multiplication unit. The design is based on non-overlapped scanning of 3-bit fields of the multiplier. …”
    Get full text
    Get full text
    article
  16. 16
  17. 17

    Structural similarity evaluation between XML documents and DTDs by Tekli, J.

    Published 2007
    “…We consider the various DTD operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes. Our approach is based on the concept of tree edit distance, as an effective and efficient means for comparing tree structures, XML documents and DTDs being modeled as ordered labeled trees. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  18. 18

    Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying by Tekli, Joe

    Published 2023
    “…Most methods rely on the concept of Lowest Comment Ancestor (LCA) between two or multiple structural nodes to identify the most specific XML elements containing query keywords posted by the user. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  19. 19

    Approximate XML structure validation technical report by Tekli, Joe

    Published 2014
    “…Our approach exploits the concept of tree edit distance, introducing a novel edit distance recurrence and dedicated algorithms to effectively compare XML documents and grammar structures, modeled as ordered labeled trees. …”
    Get full text
    Get full text
    Get full text
    article
  20. 20

    Oversampling techniques for imbalanced data in regression by Samir Brahim Belhaouari (9427347)

    Published 2024
    “…For tabular data, we also present the Auto-Inflater neural network, utilizing an exponential loss function for Autoencoders. …”