Search Results - (( java implementation new algorithm ) OR ( using execution tree algorithm ))

Refine Results
  1. 1

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    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
  4. 4
  5. 5

    Application of genetic algorithm and JFugue in an evolutionary music generator by Tang, Jia Rou

    Published 2025
    “…This project explores the application of Genetic Algorithms (GA) with JFugue, which is a Java-based music programming library to develop an Evolutionary Music Generator. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  6. 6

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

    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
  8. 8
  9. 9
  10. 10

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

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  12. 12

    Fitness value based evolution algorithm approach for text steganalysis model by Din, Roshidi, Samsudin, Azman, Tuan Muda, Tuan Zalizam, Lertkrai, P., Amphawan, Angela, Omar, Mohd Nizam

    Published 2013
    “…In this paper, we present a new alternative method for text steganalysis based on an evolution algorithm, implemented using the Java Evolution Algorithms Package (JEAP).The main objective of this paper is to detect the existence of hidden messages ased on fitness values of a text description.It is found that the detection performance has been influenced by two groups of fitness values which are good fitness value and bad fitness value. …”
    Get full text
    Get full text
    Article
  13. 13

    Classification System for Heart Disease Using Bayesian Classifier by Magendram, Anusha

    Published 2007
    “…This system was developing base on to three main part which is data processing, testing and implementation of the algorithm. In this system a Bayesian algorithm was used in order to implement the system. …”
    Get full text
    Get full text
    Thesis
  14. 14

    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
  15. 15
  16. 16

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

    Biometrics electronic purse by Abdul Rahman, Abdul Wahab, Eng, Chong Tan, S., M. Heng

    Published 1999
    “…This paper looked into using biometrics as a mean of authentication, thus requiring a new generation of Smart Card technology to be implemented in banking and multiple applications environment. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  18. 18

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

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

    Priority and dynamic quantum time algorithms for central processing unit scheduling by Mohammed, Maysoon A.

    Published 2018
    “…The proposed algorithms (Priority Dynamic Quantum Time and Multi Priority Dynamic Quantum Time Algorithms) are implemented using JAVA programming language and validated using Key Performance Indicators equations. …”
    Get full text
    Get full text
    Thesis