Search Results - (( java implementation a algorithm ) OR ( using complex graph algorithm ))

Search alternatives:

Refine Results
  1. 1
    An improved algorithm for channel allocation on direct sequence spread spectrum

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Meanwhile between the VMA and Dsatur algorithm in the complex graph is equivalent to 18.1%.However,VMA and Welsh Powell algorithm is not compared in the complex graph since its drawback in terms of not fulfill the graph coloring concept.This is because there are two adjacent vertices have the same color.Overall, even there is no reduction for number of required channel among VMA,Dsatur algorithm and Welsh Powell algorithm in the simple graph,but the outstanding significant contribution of VMA since it has reduction in the complex graph.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Accelerating graph algorithms with priority queue processor

    Accelerating graph algorithms with priority queue processor by Heng Sun, Ch'ng, Eik Wee, Chew, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

    Published 2006
    “…Of the various graph algorithms, techniques for searching a graph are the heart of graph algorithms. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics

    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

    Published 2023
    “…For this issue, this study proposes using intelligent agents to reduce the reachability time in calculating between the nodes and use the naïve approach prune algorithm to remove unnecessary edges, minimizing the attack graph's complexity. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Implement edge pruning to enhance attack graph generation using the naïve approach algorithm

    Implement edge pruning to enhance attack graph generation using the naïve approach algorithm by Al-Araji, Zaid J., Mutlag, Ammar Awad, Syed Ahmad, Sharifah Sakinah

    Published 2024
    “…For this issue, this study proposes using the naïve approach prune algorithm and using Personal agents to reduce the reachability time in calculating between the nodes and to remove unnecessary edges, minimizing the attack graph’s complexity. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    “…Results of the performance tests on the proposed hardware graph accelerator, graph computations are significantly improved in terms of algorithm complexity and execution speed.…”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    RSA Encryption & Decryption using JAVA

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The key is the trigger mechanism to the algorithm. Until the advent of the Internet, encryption was rarely used by the public, but was largely a military tool. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  7. 7
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The scope of the paper based on optimal path trace back using graph theory. The kind of graph theory that been used was indirected graph with linear algebra. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Attack prediction to enhance attack path discovery using improved attack graph

    Attack prediction to enhance attack path discovery using improved attack graph by Al-Araji, Zaid Jasim, Abdullah, Raihana Syahirah, Syed Ahmad, Sharifah Sakinah

    Published 2022
    “…In order to overcome this limitation, this present study recommends the use of intelligent agents to reduce reachability time by calculating between the nodes, as well as using the A*prune algorithm to remove useless edges and reduce attack graph complexity. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The scope of the paper based on optimal path trace back using graph theory. The kind of graph theory that been used was indirected graph with linear algebra. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  10. 10
    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm

    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

    Published 2020
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Direct approach for mining association rules from structured XML data

    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
    Save to List
    Saved in:
  12. 12
    COVID-19 DATA EXPLORATION USING MAPPER ALGORITHM

    COVID-19 DATA EXPLORATION USING MAPPER ALGORITHM by Carey, Ling Yu Fan

    Published 2023
    “…To investigate and capture the development of the pandemic, mapper algorithm can be used to visualize and analyse the COVID data set provided by the government. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  13. 13
    Image segmentation based on normalised cuts with clustering algorithm

    Image segmentation based on normalised cuts with clustering algorithm by Choong, Mei Yeen

    Published 2013
    “…Thus, an approach to facilitate the normalised cuts algorithm is performed for effective image segmentation to reduce the complexity of the similarity measurement. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm

    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

    Published 2008
    “…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences

    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  16. 16
    Scalability and performance in duplicate detection : relational vs. graph database

    Scalability and performance in duplicate detection : relational vs. graph database by Muhammad Farhad, Khaharruddin

    Published 2023
    “…As a result, they may not be effective in identifying and resolving duplicate data in certain use cases. Graph-based algorithms such as community detection, may prove beneficial as it can capture a more complex relationships between data. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  17. 17
    Provider independent cryptographic tools

    Provider independent cryptographic tools by Ibrahim, Subariah, Salleh, Mazleena, Abdul Aziz, Shah Rizan

    Published 2003
    “…The library is implemented by using Java cryptographic service provider framework that conforms to Java Cryptographic Architecture (JCA) and Java Cryptographic Extension (JCE). …”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  18. 18
    Excel as an aid to find parametric arc length in complex graph for undergraduate students

    Excel as an aid to find parametric arc length in complex graph for undergraduate students by Azri, Amir Harith, Harun, Nurzalina, Sadikin, Zubaidah, Rathi, Sidik, Mohd Sidek, Nur Zafirah, Batcha, Siti Rahimah, Salim Nasir, Mohd Agos

    Published 2024
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Parameter estimation of multivariable system using Fuzzy State Space Algorithm / Razidah Ismail … [et al.]

    Parameter estimation of multivariable system using Fuzzy State Space Algorithm / Razidah Ismail … [et al.] by Ismail, Razidah, Ahmad, Tahir, Harish, Noor Ainy, A. Halim, Rosenah

    Published 2011
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  20. 20
    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs

    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs by Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi

    Published 2017
    “…Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: