Search Results - (( java implementation level algorithm ) OR ( using complex graph algorithm ))
Search alternatives:
- implementation level »
- java implementation »
- level algorithm »
- graph algorithm »
- using complex »
- complex graph »
-
1
An improved algorithm for channel allocation on direct sequence spread spectrum
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 -
2
Accelerating graph algorithms with priority queue processor
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 -
3
Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics
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 -
4
Implement edge pruning to enhance attack graph generation using the naïve approach algorithm
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 -
5
AUTOMATED MODEL GENERATION OF FSM AND NUSMV MODEL FROM RSA JAVA SOURCE CODE FOR MODEL CHECKING
Published 2021“…The encryption algorithms are playing an important part in the protection level for data. …”
Get full text
Get full text
Thesis -
6
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
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 -
7
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
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 -
8
Attack prediction to enhance attack path discovery using improved attack graph
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 -
9
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
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 -
10
-
11
COVID-19 DATA EXPLORATION USING MAPPER ALGORITHM
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 -
12
Implementation of (AES) Advanced Encryption Standard algorithm in communication application
Published 2014“…Internet communication has become more common in this modern world recently, and one of the important algorithms used is ABS algorithm. However, most of the users have inadequate knowledge and understanding regard to this algorithm implementation in the communication field, as well as the level of security and accuracy will be questioned by the users because of the necessary to maintain the confidentiality of particular data transferred. …”
Get full text
Get full text
Undergraduates Project Papers -
13
Image segmentation based on normalised cuts with clustering algorithm
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 -
14
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
15
Scalability and performance in duplicate detection : relational vs. graph database
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 -
16
-
17
Parameter estimation of multivariable system using Fuzzy State Space Algorithm / Razidah Ismail … [et al.]
Published 2011Get full text
Get full text
Research Reports -
18
Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter
Published 2019“…It does not consider the LACE algorithm implemented in huge number of server in one Cloud datacenter. …”
Get full text
Get full text
Thesis -
19
An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs
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 -
20
Dissimilarity algorithm on conceptual graphs to mine text outliers
Published 2009“…In Comparison to other text outlier detection method, this approach managed to capture the semantics of documents through the use of CGs and is convenient to detect outliers through a simple dissimilarity function.Furthermore, our proposed algorithm retains a linear complexity with the increasing number of CGs.…”
Get full text
Get full text
Get full text
Conference or Workshop Item
