يعرض 1 - 20 نتائج من 278 نتيجة بحث عن '(( relevant data algorithm ) OR ((( present n algorithm ) OR ( neural coding algorithm ))))', وقت الاستعلام: 0.16s تنقيح النتائج
  1. 1
  2. 2
  3. 3

    Efficient O(n) BIST algorithms for DDNPS faults in dual portmemories حسب Amin, A.A.

    منشور في 2020
    "…New fault models for both the memory array and the address decoders are proposed and efficient O(n) test algorithms are presented. The new fault models account for the simultaneous dual access property of the device. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  4. 4
  5. 5

    Variable Selection in Data Analysis: A Synthetic Data Toolkit حسب Mitra, Rohan

    منشور في 2024
    "…Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). …"
    احصل على النص الكامل
    article
  6. 6
  7. 7
  8. 8
  9. 9

    New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n) حسب Gutub, Adnan

    منشور في 2002
    "…We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate the inversion in hardware. It is also presented how to obtain a fast hardware algorithm to compute the inverse by multi-bit shifting method. …"
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  10. 10
  11. 11

    UniBFS: A novel uniform-solution-driven binary feature selection algorithm for high-dimensional data حسب Behrouz Ahadzadeh (19757022)

    منشور في 2024
    "…UniBFS exploits the inherent characteristic of binary algorithms-binary coding-to search the entire problem space for identifying relevant features while avoiding irrelevant ones. …"
  12. 12

    Auto-indexing Arabic texts based on association rule data mining. (c2015) حسب Rouba G. Nasrallah

    منشور في 2015
    "…Our model denotes extracting new relevant words by relating those chosen by the previous classical methods, to new words using data mining rules. …"
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17

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

    منشور في 2011
    "…Combining exhaustive enumeration when |B| is small with the Weighted Steiner Tree approach when |B| is large, solves the problem in O⁎(n1.4143). In this paper we present a first non-trivial exact algorithm whose running time is in O⁎(n1.3645). …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  18. 18
  19. 19

    A direct algorithm for the parameterized face cover problem حسب Abu-Khzam, Faisal N.

    منشور في 2017
    "…The main contribution of this paper is a direct and relatively simple O(5kn) face cover branching algorithm. A direct O(n2) face cover kernelization algorithm is also presented.…"
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  20. 20