Search alternatives:
processing algorithm » processing algorithms (Expand Search)
query processing » text processing (Expand Search)
deer algorithm » search algorithm (Expand Search)
element deer » elementi per (Expand Search)
Showing 1 - 20 results of 21 for search '(((( element graph algorithms ) OR ( element deer algorithm ))) OR ( query processing algorithm ))', query time: 0.12s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4

    GENETIC SCHEDULING OF TASK GRAPHS by Benten, M. S.

    Published 2020
    “…A genetic algorithm for scheduling computational task graphs is presented. …”
    Get full text
    article
  5. 5

    Random Forest Bagging and X‐Means Clustered Antipattern Detection from SQL Query Log for Accessing Secure Mobile Data by Rajesh Kumar Dhanaraj (19646269)

    Published 2021
    “…Experiments are conducted to evaluate the performance of the RFBXSQLQC technique using the IIT Bombay dataset using the metrics like antipattern detection accuracy, time complexity, false-positive rate, and computational overhead with respect to the differing number of queries. The results revealed that the RFBXSQLQC technique outperforms the existing algorithms by 19% with pattern detection accuracy, 34% minimized time complexity, 64% false-positive rate, and 31% in terms of computational overhead.…”
  6. 6

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

    Published 2023
    “…Many efforts have been deployed by the IR community to extend freetext query processing toward semi-structured XML search. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  7. 7

    Full-fledged semantic indexing and querying model designed for seamless integration in legacy RDBMS by Tekli, Joe

    Published 2018
    “…We then provide a general keyword query model with specially tailored query processing algorithms built on top of SemIndex, in order to produce semantic-aware results, allowing the user to choose the results' semantic coverage and expressiveness based on her needs. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  8. 8

    A hybrid graph representation for recursive backtracking algorithms by Abu-Khzam, Faisal N.

    Published 2017
    “…The performance of these algorithms often suffers from the increasing number of graph modifications, such as deletions, that reduce the problem instance and have to be “taken back” frequently during the search process. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  9. 9

    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem by Harmanani, Haidar M.

    Published 2002
    “…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
    Get full text
    Get full text
    article
  10. 10

    Properties of Unique Degree Sequences of 3-Uniform Hypergraphs by Tarsissi, Lama

    Published 2021
    “…A well known result of Erdös and Gallai (1960) shows that the same problem related to graphs can be solved in polynomial time. So, it becomes relevant to detect classes of uniform hypergraphs that are reconstructible in polynomial time. …”
    Get full text
  11. 11

    Correlation Clustering with Overlaps by Fakhereldine, Amin

    Published 2020
    “…The Cluster Editing problem asks for transforming a given graph into a disjoint union of cliques by applying a minimal number of edge-editing operations. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  12. 12

    Con-Detect: Detecting adversarially perturbed natural language inputs to deep classifiers through holistic analysis by Hassan, Ali

    Published 2023
    “…Deep Learning (DL) algorithms have shown wonders in many Natural Language Processing (NLP) tasks such as language-to-language translation, spam filtering, fake-news detection, and comprehension understanding. …”
    Get full text
    Get full text
    Get full text
    article
  13. 13
  14. 14

    Con-Detect: Detecting Adversarially Perturbed Natural Language Inputs to Deep Classifiers Through Holistic Analysis by Hassan Ali (3348749)

    Published 2023
    “…<p>Deep Learning (DL) algorithms have shown wonders in many Natural Language Processing (NLP) tasks such as language-to-language translation, spam filtering, fake-news detection, and comprehension understanding. …”
  15. 15
  16. 16

    On the complexity of multi-parameterized cluster editing by Abu-Khzam, Faisal

    Published 2017
    “…The Cluster Editing problem seeks a transformation of a given undirected graph into a disjoint union of cliques via a minimum number of edge additions or deletions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  17. 17

    SemIndex: Semantic-Aware Inverted Index by Chbeir, Richard

    Published 2017
    “…We also provide an extended query model and related processing algorithms with the help of SemIndex. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  18. 18

    Agent-Based Reactive Geographic Routing Protocol for Internet of Vehicles by Mazouzi, Mohamed

    Published 2023
    “…The design of an efficient routing algorithm for Internet of Vehicles (IoV) is a challenging research issue due to the inherent characteristics of IoV network, such as high-speed mobility of nodes, frequent topology change, link instability, and the presence of radio obstacles. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  19. 19

    Big Data Energy Management, Analytics and Visualization for Residential Areas by Gupta, Ragini

    Published 2020
    “…A high-speed distributed computing cluster based on commodity hardware with efficient big data mathematical algorithm is employed in this work. To achieve this, two big data processing paradigms are evaluated with a set of qualitative and quantitative metrics with subsequent recommendations. …”
    Get full text
    article
  20. 20