Search Results - (( java segmentation using algorithm ) OR ( using execution tree algorithm ))

Refine Results
  1. 1

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    Published 2010
    “…Finally, the algorithm found, which would solve the image segmentation problem.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…On the other hand, the traditional algorithm using template matching only obtained 83.65% recognition rate with 0.97 second processing time. …”
    Get full text
    Get full text
    Get full text
    Book
  4. 4

    Enhance efficiency of answering XML keyword query using incompact structure of MCCTree by Sazaly, Ummu Sulaim

    Published 2012
    “…If the result cannot be used directly by the ranking method, the algorithm has an ineffective process. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6
  7. 7

    Disparity map algorithm using hierarchical of bitwise pixel differences and segment-tree from stereo image by Zainal Azali, Muhammad Nazmi

    Published 2024
    “…The adaptability of the algorithm is demonstrated through a 3D surface reconstruction using a final disparity map. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    The stopping rules for winsorized tree by Chee, Keong Ch’ng, Mahat, Nor Idayu

    Published 2017
    “…This mechanism is controlled by the proposed algorithm. In winsorized tree, data are screened for identifying outlier.If outlier is detected, the value is neutralized using winsorize approach. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9
  10. 10
  11. 11

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

    Published 2011
    “…The advancement of technology in scientific community has produced terabytes of biological data.This datum includes DNA sequences.String matching algorithm which is traditionally used to match DNA sequences now takes much longer time to execute because of the large size of DNA data and also the small number of alphabets.To overcome this problem, the indexing methods such as suffix arrays or suffix trees have been introduced.In this study we used suffix arrays as indexing algorithm because it is more applicable, not complex and used less space compared to suffix trees.The parallel method is then introduced to speed up the index construction process. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    An optimized attack tree model for security test case planning and generation by Omotunde, Habeeb, Ibrahim, Rosziati, Ahmed, Maryam

    Published 2018
    “…By leveraging on the optimized attack tree algorithm used in this research work, the threat model produces efficient test plans from which adequate test cases are derived to ensure a secured web application is designed, implemented and deployed. …”
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Optimizing B-tree search performance of big data sets / Mohsen Marjani by Mohsen , Marjani

    Published 2017
    “…This study proposes an optimized B-tree search method to improve the execution time of the search tasks and to optimize the performance of the B-tree search process. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Dhany, Saputra

    Published 2008
    “…Moreover,improper management of intermediate databases may adversely affect the execution time and memory utilization. In the present work, Separator Database is proposed to improve PrefixSpan with pseudoprojection through early removal of uneconomical in-memory sequenced database, whilst SPM-Tree framework is proposed to build the intermediated databases. …”
    Get full text
    Thesis
  16. 16

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    “…Moreover,improper management of intermediate databases may adversely affect the execution time and memory utilization. In the present work, Separator Database is proposed to improve PrefixSpan with pseudoprojection through early removal of uneconomical in-memory sequenced database, whilst SPM-Tree framework is proposed to build the intermediated databases. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Keylogger detection analysis using machine learning algorithm / Muhammad Faiz Hazim Abdul Rahman by Abdul Rahman, Muhammad Faiz Hazim

    Published 2022
    “…It is intended that this initiative would deliver benefits to all of the users and be useful to them.…”
    Get full text
    Get full text
    Student Project
  18. 18

    Sentiment Analysis on Users' Satisfaction for Mobile Banking Apps in Malaysia by Misinem, ., Tri Basuki, Kurniawan, Mohd Zaki, Zakaria, Muhammad Aqil Azfar, Uzailee

    Published 2022
    “…The best accuracy result shows 94.37% by the Decision Tree algorithm, and Naïve Bayes obtained the worst outcome at 66%.…”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    An Integrated Principal Component Analysis And Weighted Apriori-T Algorithm For Imbalanced Data Root Cause Analysis by Ong, Phaik Ling

    Published 2016
    “…On the other hand, Apriori-T with indexing enumeration tree is used for low cost FPM. A semiconductor manufacturing case study with Work In Progress data and true alarm data is used to proof the proposed algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20