Search alternatives:
processing algorithm » processing algorithms (Expand Search)
method algorithm » mould algorithm (Expand Search)
query processing » text processing (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
Showing 41 - 60 results of 309 for search '(((( elements method algorithm ) OR ( present data algorithm ))) OR ( query processing algorithm ))', query time: 0.15s Refine Results
  1. 41
  2. 42

    Topics in graph algorithms by Abu-Khzam, Faisal Nabih

    Published 2003
    “…This is achieved by implementing some algorithms for the vertex cover problem, and conducting experiments on real data sets. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  3. 43
  4. 44
  5. 45
  6. 46
  7. 47
  8. 48
  9. 49

    Correlation Clustering with Overlaps by Fakhereldine, Amin

    Published 2020
    “…Moreover, we allow the new vertex splitting operation, which allows the resulting clusters to overlap. In other words, data elements (or vertices) will be allowed to be members in more than one cluster instead of limiting them to only one single cluster, as in classical clustering methods. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  10. 50

    Robust Control Of Sampled Data Systems by AL-Sunni, Fouad

    Published 2020
    “…The authors present robust stability bounds for sampled data systems. …”
    Get full text
    article
  11. 51

    Robust control of sampled data systems by Al-Sunni, F.M.

    Published 1998
    “…The authors present robust stability bounds for sampled data systems. …”
    Get full text
    Get full text
    article
  12. 52

    Robust Control Of Sampled Data Systems by AL-Sunni, Fouad

    Published 2020
    “…The authors present robust stability bounds for sampled data systems. …”
    Get full text
    article
  13. 53

    Robust Control Of Sampled Data Systems by AL-Sunni, Fouad

    Published 2020
    “…The authors present robust stability bounds for sampled data systems. …”
    Get full text
    article
  14. 54

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

    Published 2024
    “…For such high-dimension data our approach outperforms the Synthetic Minority Oversampling Technique for Regression (SMOTER) algorithm for the IMDB-WIKI and AgeDB image datasets. …”
  15. 55
  16. 56

    Data Redundancy Management in Connected Environments by Mansour, Elio

    Published 2020
    “…., building) equipped with sensors that produce and exchange raw data. Although the sensed data is considered to contain useful and valuable information, yet it might include various inconsistencies such as data redundancies, anomalies, and missing values. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  17. 57

    Unsupervised outlier detection in multidimensional data by Atiq ur Rehman (14153391)

    Published 2022
    “…<p>Detection and removal of outliers in a dataset is a fundamental preprocessing task without which the analysis of the data can be misleading. Furthermore, the existence of anomalies in the data can heavily degrade the performance of machine learning algorithms. …”
  18. 58

    A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

    Published 2010
    “…For 3-Hitting Set, an arbitrary instance is reduced into an equivalent one that contains at most 5k2+k elements. This kernelization is an improvement over previously known methods that guarantee cubic-order kernels. …”
    Get full text
    Get full text
    Get full text
    article
  19. 59

    Graph Contraction for Mapping Data on Parallel Computers by Mansour, N.

    Published 1994
    “…The mapping solution for the original problem is obtained by a straightforward interpolation. We then present experimental results on using contracted graphs as inputs to two physical optimization methods; namely, genetic algorithm and simulated annealing. …”
    Get full text
    Get full text
    Get full text
    article
  20. 60

    Mapping realistic data sets on parallel computers by Mansour, N.

    Published 1993
    “…The authors propose reducing the problem size by a mapping-oriented graph contraction technique. They present a graph contraction (GC) heuristic algorithm that yields a smaller representation of the problem, to which mapping is then applied. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject