Search Results - ((graph algorithm) OR (based 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
    “…Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python

    Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python by Arifin, Samsul, Muktyas, Indra Bayu, Al Maki, Wikky Fawwaz, Mohd Khairul Bazli, Mohd Aziz

    Published 2022
    “…In this article, the researchers design an algorithm and apply it to a computer program (Python) to solve graph coloring and to visualize the variation of exam scheduling modeling at Binus University in graphs based on the Bitwise Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    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
    “…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
    Save to List
    Saved in:
  5. 5
    Identification of power poles based on satellite stereo images using graph-cut algorithm

    Identification of power poles based on satellite stereo images using graph-cut algorithm by Qayyum, Abdul, Malik, Aamir Saeed, Mohamad Saad, Mohamad Naufal, Ahmad, Rana Fayyaz, Taun Abdullah, Taun Ab Rashid

    Published 2015
    “…In this paper, we proposed a new method to detect the vegetation using satellite stereo imagery. The method is based on Graph-Cut algorithm which applied on satellite stereo images. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    Image segmentation based on normalised cuts with clustering algorithm

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

    Published 2013
    “…With the approach applied in the normalised cuts based image segmentation, the constraint of using normalised cuts algorithm in image segmentation can be alleviated. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.

    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

    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
    Save to List
    Saved in:
  8. 8
    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    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
    Save to List
    Saved in:
  9. 9
    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
    “…This paper investigates the swarm intelligence behaviour represented by a population-based approach called the bat algorithm (BA) to find the smallest set of nodes that dominate the graph. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    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
    Save to List
    Saved in:
  11. 11
    Web user navigation pattern mining approach based on graph partitioning algorithm.

    Web user navigation pattern mining approach based on graph partitioning algorithm. by Jalali, Mehrdad, Mustapha, Norwati, Mamat, Ali, Sulaiman, Md. Nasir

    Published 2008
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…This project implement a algorithm for the optimal transistor chaining problem in CMOS functional cell layout based on Uehara and vanCleemput's layout style [1] which assumed that the height of each logic module layout is constant and performed the optimisation by decomposing the graph module into a minimum number of sub graph having a dual Euler (d-Euler) trail.. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Identification of power poles based on satellite stereo images using graph-cut algorithm

    Identification of power poles based on satellite stereo images using graph-cut algorithm by Qayyum, A., Malik, A.S., Saad, M.N.M., Ahmad, R.F., Abdullah, A.R.T.

    Published 2015
    “…In this paper, we proposed a new method to detect the vegetation using satellite stereo imagery. The method is based on Graph-Cut algorithm which applied on satellite stereo images. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Identification of power poles based on satellite stereo images using graph-cut algorithm

    Identification of power poles based on satellite stereo images using graph-cut algorithm by Qayyum A., Malik A.S., Saad M.N.M., Ahmad R.F., Abdullah A.R.T.

    Published 2023
    “…Algorithms; Graphic methods; Image matching; Image processing; Optical radar; Poles; Satellite imagery; Satellites; Signal detection; Signal processing; Vegetation; Damage compensations; Electrical distribution; Graph cut; High voltage transmission lines; Monitoring methods; Stereo matching; Stereo matching algorithm; Stereo-image; Stereo image processing…”
    Conference Paper
    Save to List
    Saved in:
  15. 15
    Multiregion segmentation of mammogram images by using parametric kernel graph cut algorithm / Nurhanani Abdul Rahim, Nor Farah Nabilah Mushtafa and Nadhirah Afiqah Zailan

    Multiregion segmentation of mammogram images by using parametric kernel graph cut algorithm / Nurhanani Abdul Rahim, Nor Farah Nabilah Mushtafa and Nadhirah Afiqah Zailan by Abdul Rahim, Nurhanani, Mushtaf, Nor Farah Nabilah, Zailan, Nadhirah Afiqah

    Published 2019
    “…Therefore, Parametric Kernel Graph Cut Algorithm was used in this study. Parametric Kernel Graph Cut Algorithm is an improvisation of the original Graph Cut. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  16. 16
    Predicting future sales using genetic algorithm: data mining sales / Siti Hajar Yaacob

    Predicting future sales using genetic algorithm: data mining sales / Siti Hajar Yaacob by Yaacob, Siti Hajar

    Published 2014
    “…Besides that, Genetic Algorithm is applying to predict future sales based on the sales and product data. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems

    Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

    Published 2016
    “…Mostly the state of art approximation algorithms for the MVC problem are based on greedy approaches, or inspired from MIS approaches. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm

    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm by Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N.

    Published 2012
    “…Graph colouring is a useful algorithm for channel allocation on wireless local area network (WLAN). …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop

    Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop by Mohd Yakop, Mohammad Arsyad

    Published 2017
    “…The Directed Acyclic Graph in High Dimensional Dataset Mining (DAGHDDM) is a graph-based mining algorithm that represents itemsets in complete graph before FIM takes place. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Evaluation of Visual Network Algorithms on Historical Documents

    Evaluation of Visual Network Algorithms on Historical Documents by Khairunnisa, Binti Ibrahim

    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
    Save to List
    Saved in:

Search Tools: