Search alternatives:
processing algorithm » processing algorithms (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
Showing 181 - 200 results of 795 for search '(( elements data algorithm ) OR ((( data processing algorithm ) OR ( time using algorithm ))))*', query time: 0.11s Refine Results
  1. 181

    Multi-Modal Emotion Aware System Based on Fusion of Speech and Brain Information by M. Ghoniem, Rania

    Published 2019
    “…In all likelihood, while features from several modalities may enhance the classification performance, they might exhibit high dimensionality and make the learning process complex for the most used machine learning algorithms. …”
    Get full text
    Get full text
  2. 182

    Algorithms for Pixelwise Shape Deformations Preserving Digital Convexity by Tarsissi, Lama

    Published 2022
    “…In this article, we propose algorithms for pixelwise deformations of digital convex sets preserving their convexity using the combinatorics on words to identify digital convex sets via their boundary words, namely Lyndon and Christoffel words. …”
    Get full text
  3. 183

    An Evolutionary Algorithm for the Allocation Problem in High-Level Synthesis by Harmanani, Haidar

    Published 2005
    “…The proposed method was implemented using C++ on a Linux workstation. We tested our method on a set of high-level synthesis benchmarks, all yielding good solutions in a short time. …”
    Get full text
    Get full text
    Get full text
    article
  4. 184

    Algorithmic Study of Online Multi-Facility Location Problems by Markarian, Christine

    Published 2022
    “…We propose the first online algorithms for these variants and measure their performance using the standard notion of competitive analysis. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  5. 185

    A neural networks algorithm for data path synthesis by Harmanani, Haidar M.

    Published 2003
    “…The algorithm has a running time complexity of O(1) for a circuit with n operations and c shared resources. …”
    Get full text
    Get full text
    Get full text
    article
  6. 186

    Data redundancy management for leaf-edges in connected environments by Mansour, Elio

    Published 2022
    “…Major advances in the fields of Internet and Communication Technology (ICT), data modeling/processing, and sensing technology have rendered traditional environments (e.g., cities, buildings) more connected. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  7. 187

    Optimizing Document Classification: Unleashing the Power of Genetic Algorithms by Ghulam Mustafa (458105)

    Published 2023
    “…Additionally, our proposed model optimizes the features using a genetic algorithm. Optimal feature selection performances a crucial role in this domain, enhancing the overall accuracy of the document classification system while reducing the time complexity associated with selecting the most relevant features from this large-dimensional space. …”
  8. 188
  9. 189

    An exact algorithm for connected red–blue dominating set by Abu-Khzam, Faisal N.

    Published 2011
    “…In this paper we present a first non-trivial exact algorithm whose running time is in O⁎(n1.3645). We use our algorithm to solve the Connected Dominating Set problem in O⁎(n1.8619). …”
    Get full text
    Get full text
    Get full text
    article
  10. 190

    Adaptive Secure Pipeline for Attacks Detection in Networks with set of Distribution Hosts by ALSHAMSI, SUROUR

    Published 2022
    “…So far none addresses the use of Threat Intelligence (IT) data in Ensemble Learning algorithms to improve the detection process, nor does it work as a function of time, that is, taking into account what happens on the network in a limited time interval. …”
    Get full text
  11. 191
  12. 192
  13. 193

    A FAMILY OF NORMALIZED LEAST MEAN FOURTH ALGORITHMS by Zerguine, Azzedine

    Published 2020
    “…The first proposed algorithm uses a simple normalization of the regressor and is called simply the NLMF. …”
    Get full text
    article
  14. 194
  15. 195

    Data reductions and combinatorial bounds for improved approximation algorithms by Abu-Khzam, Faisal N.

    Published 2016
    “…We will expose in this paper a similar strategy for obtaining polynomial-time approximation algorithms. Our method features the use of approximation-preserving reductions, akin to the notion of parameterized reductions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  16. 196

    A hybrid genetic algorithm for task allocation in multicomputers by Mansour, Nashat

    Published 2018
    “…A hybrid genetic algorithm for the task allocation problem (HGATA) in multicomputers is presented. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  17. 197
  18. 198
  19. 199

    Social spider optimization algorithm: survey and new applications by Abualigah, Laith

    Published 2024
    “…This algorithm has been developed over time, resulting in many versions besides theories and findings. …”
    Get full text
  20. 200