Search Results - been ((graph algorithm) OR (based algorithm))
Search alternatives:
-
1
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
Published 2007“…It has been shown that the performance of a graph-based shortest path algorithm can severely be affected by the performance of its priority queue. …”
Get full text
Get full text
Get full text
Thesis -
2
Image segmentation based on normalised cuts with clustering algorithm
Published 2013“…Evaluation of c -means and fuzzy c-means clustering algorithm with normalised cuts image segmentation on various kinds of images has been carried out. …”
Get full text
Get full text
Get full text
Thesis -
3
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 -
4
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
Published 2010“…The kind of graph theory that been used was indirected graph with linear algebra. …”
Get full text
Get full text
Article -
5
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
Published 2010“…The kind of graph theory that been used was indirected graph with linear algebra. …”
Get full text
Get full text
Student Project -
6
Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems
Published 2016“…In this paper, we have introduced small benchmark instances and some state of the art algorithms (MDG, VSA, and MVSA) have been tested along with the proposed algorithm. …”
Get full text
Get full text
Get full text
Article -
7
Evaluation of Visual Network Algorithms on Historical Documents
Published 2020“…The framework has been used to evaluate three graph layout and three graph clustering algorithms on the historical SAGA dataset. …”
Get full text
Get full text
Get full text
Thesis -
8
Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site
Published 2017“…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
Get full text
Get full text
Final Year Project -
9
Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review
Published 2018“…The small benchmark graphs will help the researchers to evaluate efficient approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text
Article -
10
Retrieval Of Environmental Parameters Over Water Areas Using MODIS Data
Published 2012“…The algorithm is based on the gradient connecting the 1.38 and 1.24 μm lines of the log– log graph of apparent reflectance against the MODIS wavelength. …”
Get full text
Get full text
Thesis -
11
A comparative study of greedy algorithms and dynamic programming in road network / Nuralya Sofea Hairulanuar
Published 2024“…Dijkstra's algorithm and A* algorithm have been shown to be very efficient for solving single-source shortest route problems. …”
Get full text
Get full text
Thesis -
12
FROM IMAGE TO GRAPH-BASED DATA FOR PATH PLANNING
Published 2019“…This implementation of graph traversal, statistics and machine learning algorithms were a challenging part to be done. …”
Get full text
Get full text
Final Year Project -
13
A Web-Based Recommendation System To Predict User Movements Through Web Usage Mining
Published 2009“…The approach in the offline phase is based on the new graph partitioning algorithm to model user navigation patterns for the navigation patterns mining. …”
Get full text
Get full text
Thesis -
14
Effects of Different Superpixel Algorithms on Interactive Segmentations
Published 2022“…The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
Get full text
Get full text
Get full text
Article -
15
A multi-view clustering algorithm for attributed weighted multi-edge directed networks
Published 2022“…Our algorithm first converts the given AWMEDiG into a new weighted graph. …”
Get full text
Get full text
Article -
16
A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network
Published 2018“…The Ant Colony Optimization (ACO) Algorithm has been adapted for the protein functional module detection by modeling the problem as an optimization problem. …”
Get full text
Get full text
Get full text
Article -
17
Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics
Published 2023“…This study employs use Random Forest algorithm to identify and forecast attacks to dynamically locate the attack location in the network for attack graph analysis. …”
Get full text
Get full text
Get full text
Thesis -
18
Effects of Different Superpixel Algorithms on Interactive Segmentations
Published 2022“…The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
19
Implement edge pruning to enhance attack graph generation using the naïve approach algorithm
Published 2024“…The next generation cyber defence concentrating on predictive analysis seems more proactive than existing technologies based on intrusion detection. Recently, many approaches have been proposed to detect and predict attacks; one of these approaches is attack graphs. …”
Get full text
Get full text
Get full text
Get full text
Article -
20
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010“…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
Get full text
Get full text
Thesis