Search Results - parallel qualities ((_ algorithm) OR (based algorithm))

Search alternatives:

Refine Results
  1. 1

    Parallelization of speech compression based algorithm based on human auditory system on multicore system by Gunawan, Teddy Surya, Kartiwi, Mira, Khalifa, Othman Omran

    Published 2012
    “…Finally, the performance of the developed parallel algorithm was evaluated using Perceptual Evaluation of Speech Quality (PESQ) and parallel execution time. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Enhancement of parallel thinning algorithm for handwritten characters using neural network by Engkamat, Adeline

    Published 2005
    “…This project aims to improve a parallel thinning algorithm that satisfies two fundamental requirements of thinning, namely the processing speed and the quality of skeletons. …”
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4
  5. 5
  6. 6

    Implementation of Parallel K-Means Algorithm to Estimate Adhesion Failure in Warm Mix Asphalt by Akhtar, M.N., Ahmed, W., Kakar, M.R., Bakar, E.A., Othman, A.R., Bueno, M.

    Published 2020
    “…Therefore, the execution time of the image processing algorithm is also an essential aspect of quality. This manuscript proposes a parallel k means for image processing (PKIP) algorithm using multiprocessing and distributed computing to assess the adhesion failure in WMA and HMA samples subjected to three different moisture sensitivity tests (dry, one, and three freeze-thaw cycles) and fractured by indirect tensile test. …”
    Get full text
    Get full text
    Article
  7. 7

    Development of a parallel clustering of bilingual corpora based on reduced terms by Leow, Ching Leong

    Published 2015
    “…However, not many works conducted that are related to clustering bilingual documents found, especially for Malay text articles. The quality of clustering bilingual text documents is highly influenced by the quality of the bag-of-word presentation of Malay text articles presented to the clustering algorithm. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Single-objective and multi-objective optimization algorithms based on sperm fertilization procedure / Hisham Ahmad Theeb Shehadeh by Hisham Ahmad, Theeb Shehadeh

    Published 2018
    “…The obtained results are compared with the results of four algorithms. These algorithms are Genetic Algorithms (GA), Parallel Genetic Algorithm (PGA), Particle Swarm Optimization (PSO) and Accelerated Particle Swarm Optimization (APSO). …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Speech compression using compressive sensing on a multicore system by Gunawan, Teddy Surya, Khalifa, Othman Omran, Shafie, Amir Akramin, Ambikairajah, Eliathamby

    Published 2011
    “…The performance of overall algorithms will be evaluated based on the processing time and speech quality. …”
    Get full text
    Get full text
    Proceeding Paper
  11. 11

    Effective software fault localization based on complex network theory / Abubakar Zakari by Abubakar , Zakari

    Published 2019
    “…This has led researchers to adopt approaches such as one bug-at-a-time debugging approach (OBA) and parallel debugging approach. However, using OBA debugging approach increases software time-to-delivery and potentially leads to more faults during regression testing, while utilizing k-mean clustering algorithm with Euclidean distance metric to group failed tests based on their execution profile similarity in parallel debugging approach is claimed to be problematic and inappropriate. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Hybrid metaheuristics for QOS-aware service composition / Hadi Naghavipour by Hadi , Naghavipour

    Published 2022
    “…An absolute majority of base algorithms for this problem were nature-inspired and population-based metaheuristics extended to complementary methods in hybrid solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Optimization of extractive Automatic Text Summarization using Decomposition-based Multi-objective Differential Evolution and parallelization by Hazmi Wahab, Muhammad Hafizul

    Published 2024
    “…These advancements collectively propel optimization-based ATS approaches closer to real-time applications where thousands of documents could be involved, demonstrating the versatility and efficiency of the proposed MODE/D algorithm across diverse computing architectures, including multicore and many core environments.…”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    A new parameterized architectural design for SENSE reconstruction by Siddiqui, M.F., Reza, A.W., Kanesan, J., Omer, H.

    Published 2014
    “…Reconfigurable hardware based architectures that could provide good quality image reconstruction for parallel Magnetic Resonance Imaging (MRI) within very less computation time are in high demand. …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Algorithm optimization and low cost bit-serial architecture design for integer-pixel and sub-pixel motion estimation in H.264/AVC / Mohammad Reza Hosseiny Fatemi by Hosseiny Fatemi, Mohammad Reza

    Published 2012
    “…In addition, a fast version of the proposed algorithm is presented that reduces the computational budget 46.28% further while maintaining the video quality. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Magnetic resonance imaging sense reconstruction system using FPGA / Muhammad Faisal Siddiqui by Muhammad Faisal , Siddiqui

    Published 2016
    “…Sensitivity Encoding (SENSE) is a widely used technique to reconstruct the artefact free images from the Parallel MRI (pMRI) aliased data. Reconfigurable hardware based architecture for SENSE has a great potential to provide good quality image reconstruction with significantly less computation time. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19
  20. 20