Search Results - (( parallel visualization matching algorithm ) OR ( java application stemming algorithm ))

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

    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
  2. 2

    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
  3. 3

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

    Published 2012
    “…A result of barcode numbers saved in file.mat is used for product matching code. The percentage of success is 94.44% and failure of the system is 5.56%.…”
    Get full text
    Get full text
    Article
  4. 4

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

    Published 2012
    “…A result of barcode numbers saved in file.mat is used for product matching code. The percentage of success is 94.44% and failure of the system is 5.56%.…”
    Get full text
    Get full text
    Thesis