Search Results - (( _ application graph algorithm ) OR ( java implication based algorithm ))
Search alternatives:
- application graph »
- implication based »
- java implication »
- graph algorithm »
-
1
Accelerating graph algorithms with priority queue processor
Published 2006Get full text
Get full text
Article -
2
Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python
Published 2022“…The researchers develop a graph coloring algorithm by considering some of the graph vertices to be binary numbers. …”
Get full text
Get full text
Get full text
Article -
3
-
4
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
5
Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering
Published 2024“…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
Get full text
Get full text
Thesis -
6
Identification of power poles based on satellite stereo images using graph-cut algorithm
Published 2015Get full text
Get full text
Conference or Workshop Item -
7
-
8
-
9
A Review on Attack Graph Analysis for IoT Vulnerability Assessment: Challenges, Open Issues, and Future Directions
Published 2024“…Attack graphs serve as a valuable cybersecurity tool for modeling and analyzing potential attack scenarios on systems, networks, or applications. …”
Review -
10
Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems
Published 2016“…MVC and MIS are notable for its capability of modelling other combinatorial problems and real-world applications. The aim of this paper is twofold: first to investigate failures of the state-of- the-art algorithms for MVC problem on small graphs and second to propose a simple and efficient approximation algorithm for the minimum vertex cover problem. …”
Get full text
Get full text
Get full text
Article -
11
IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION
Published 2018“…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
Get full text
Get full text
Final Year Project -
12
Image matching using relational graph representation
Published 2005“…Hence, image matching is transformed as a relational graph matching problem in this study. Experiments are carried out to evaluate the applicability of incorporating structural information into the image matching algorithm. …”
Get full text
Get full text
Thesis -
13
An algorithm for constructing reduced alternating achiral knots
Published 2014Get full text
Get full text
Get full text
Article -
14
-
15
VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.
Published 2012“…A tool termed as VIGA-20 (Visualization of Genetic Algorithm using 2-0 Graph) is implemented to accomplish this goal. …”
Get full text
Get full text
Thesis -
16
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 -
17
An algorithm for constructing reduced alternating achiral knots
Published 2013Get full text
Get full text
Proceeding Paper -
18
Dissimilarity algorithm on conceptual graphs to mine text outliers
Published 2009“…The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents.As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining.In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between knowledge represented in the CGs.In this paper, we would like to present a dissimilarity algorithm to detect outliers from a collection of text represented with Conceptual Graph Interchange Format (CGIF).In order to avoid the NP-complete problem of graph matching algorithm, we introduce the use of a standard CG in the dissimilarity computation.We evaluate our method in the context of analyzing real world financial statements for identifying outlying performance indicators.For evaluation purposes, we compare the proposed dissimilarity function with a dice-coefficient similarity function used in a related previous work.Experimental results indicate that our method outperforms the existing method and correlates better to human judgements. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
-
20
Butterfly Triple System Algorithm Based on Graph Theory
Published 2022Get full text
Get full text
Get full text
Article