Search Results - parallel process matching algorithm

Search alternatives:

  • Showing 1 - 19 results of 19
Refine Results
  1. 1

    GPU-based odd and even hybrid string matching algorithm by Rahbari, Ghazal, Abdul Rashid, Nur’Aini, Husain, Wahidah

    Published 2016
    “…String matching is considered as one of the fundamental problems in computer science.Many computer applications provide the string matching utility for their users, and how fast one or more occurrences of a given pattern can be found in a text plays a prominent role in their user satisfaction.Although numerous algorithms and methods are available to solve the string matching problem, the remarkable increase in the amount of data which is produced and stored by modern computational devices demands researchers to find much more efficient ways for dealing with this issue.In this research, the Odd and Even (OE) hybrid string matching algorithm is redesigned to be executed on the Graphics Processing Unit (GPU), which can be utilized to reduce the burden of compute-intensive operations from the Central Processing Unit (CPU).In fact, capabilities of the GPU as a massively parallel processor are employed to enhance the performance of the existing hybrid string matching algorithms.Different types of data are used to evaluate the impact of parallelization and implementation of both algorithms on the GPU. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Speeding up index construction with GPU for DNA data sequences by Rahmaddiansyah, , Abdul Rashid, Nur’aini

    Published 2011
    “…Graphic processor unit (GPU) is used to parallelize a segment of an indexing algorithm. In this research, we used a GPU to parallelize the sorting part of suffix array construction algorithm.Our results show that the GPU is able to accelerate the process of building the index of the suffix array by 1.68 times faster than without GPU.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Guided genetic algorithm for solving unrelated parallel machine scheduling problem with additional resources by Abed, Munther Hameed, Mohd Nizam Mohmad, Kahar

    Published 2022
    “…Results show that the GGA outperforms the simple genetic algorithm (SGA), but it still didn't match the results in the literature. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Parallel batch self-organizing map on graphics processing unit using CUDA by Daneshpajouh, H., Delisle, P., Boisson, J.-C., Krajecki, M., Zakaria, N.

    Published 2018
    “…The most computationally expensive parts of its training algorithm (such as steps to compute distance between each data vector and neuron, and determining the Best Matching Unit based on minimum distance) are identified and mapped on GPU to be processed in parallel. …”
    Get full text
    Get full text
    Article
  5. 5

    Parallel batch self-organizing map on graphics processing unit using CUDA by Daneshpajouh, H., Delisle, P., Boisson, J.-C., Krajecki, M., Zakaria, N.

    Published 2018
    “…The most computationally expensive parts of its training algorithm (such as steps to compute distance between each data vector and neuron, and determining the Best Matching Unit based on minimum distance) are identified and mapped on GPU to be processed in parallel. …”
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system by Nurnajmin Qasrina Ann, Ayop Azmi

    Published 2018
    “…As reported in literature, conventional algorithm for image template matching such as correlation between two images took very long processing time. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Resource Minimization in a Real-time Depth-map Processing System on FPGA by Ngo, Huy Tan, Hamid, Nor Hisham, Sebastian , Patrick, Yap, Vooi Voon

    Published 2011
    “…Depth-map algorithm allows camera system to estimate depth. It is a computational intensive algorithm, but can be implemented with high speed on hardware due to the parallelism property. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Job Matching Mobile Application using Fuzzy Analytic Hierarchy Process (FAHP) / Mohammad Ashraf Jefrizin by Jefrizin, Mohammad Ashraf

    Published 2017
    “…Job matching is an innovative method in hiring process to solve this problem. …”
    Get full text
    Get full text
    Student Project
  10. 10

    Enhanced and effective parallel optical flow method for vehicle detection and tracking by Bhaskar, P.K., Yong, S.-P., Jung, L.T.

    Published 2016
    “…With a view to do improvements, it is proposed to develop an unique algorithm for vehicle data recognition and tracking using Parallel Optical Flow method based on Lucas-Kanade algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    MINIMIZATION OF RESOURCE UTILIZATION FOR A REAL-TIME DEPTH-MAP COMPUTATIONAL MODULE ON FPGA by NGO , NGO HUY TAN

    Published 2011
    “…Memory contention and bandwidth constrain were resolved by using self-initiative memory controller, FIFOs and line buffers. Parallel processing was utilized to achieve high processing speed at low clock frequency. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14

    DC-based PV-powered home energy system by Sabry, Ahmad H.

    Published 2017
    “…The monitoring outcome of the designed GUI proves the voltage matching concept between the PV array (as a source) and the battery/appliances (as a load), which represents a significant evidence for the considered matching concept. …”
    Get full text
    Get full text
    Thesis
  15. 15

    New CFAR algorithm and circuit development for radar receiver by Kamal, Mustafa Subhi

    Published 2020
    “…Therefore, the MSS-CA-CFAR is chosen to implement by practical digital circuit and there is another important feature in the MSS-CFAR algorithm that is parallel processing since the spike selection process is done at the same time with summing of samples process that makes this algorithm much less in processing time from any other algorithm using the same environment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Adopting morphology method in camera based EAN-13 1D barcode recognition using Simulink / Siti Nor Safinaz Ozaimidi by Ozaimidi, Siti Nor Safinaz

    Published 2012
    “…Each scan lines were processed by transforming it into a feature value to analyze. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Authenticating sensitive diacritical texts using residual, data representation and pattern matching methods / Saqib Iqbal Hakak by Saqib Iqbal , Hakak

    Published 2018
    “…The searching of halves is achieved through two different algorithms based on the split approach and the parallel approach respectively. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision by Abu Raid, Fadi Imad Osman

    Published 2021
    “…These algorithms are then parallelized using Compute Unified Device Architecture CUDA C language to run on Graphics Processing Unit GPU for hardware acceleration. …”
    Get full text
    Get full text
    Thesis
  19. 19

    High-Speed Implementations Of Fractal Image Compression For Low And High Resolution Images by Saad, Abdul Malik Haider Yusef

    Published 2018
    “…Therefore, in this research new hardware implementations of FIC are proposed for accelerating the encoding process by means of parallelism and pipelining. Various approaches have been investigated for achieving high speed performance. …”
    Get full text
    Get full text
    Thesis