Search Results - (( based information graph algorithm ) OR ( java application using algorithm ))
Search alternatives:
- based information »
- information graph »
- java application »
- graph algorithm »
- using algorithm »
-
1
Dynamic force-directed graph with weighted nodes for scholar network visualization
Published 2022“…The approach is realized by creating a web-based interface using D3 JavaScript algorithm that allows the visualization to focus on how data are connected to each other more accurately than the conventional lines of data seen in traditional data representation. …”
Get full text
Get full text
Article -
2
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
3
-
4
Butterfly Triple System Algorithm Based on Graph Theory
Published 2022Get full text
Get full text
Get full text
Article -
5
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 -
6
Unapparent information revelation for counterterrorism: Visualizing associations using a hybrid graph-based approach
Published 2012Get full text
Get full text
Get full text
Conference or Workshop Item -
7
An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm
Published 2012Get full text
Get full text
Conference or Workshop Item -
8
-
9
RSA Encryption & Decryption using JAVA
Published 2006“…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
Get full text
Get full text
Final Year Project -
10
Modeling of static and dynamic components of bio-nanorobotic systems
Published 2012“…In this technique, the graph-based structural models of the fullerenes are proposed using their real structural information. …”
Get full text
Get full text
Thesis -
11
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 -
12
-
13
-
14
A hybrid local search algorithm for minimum dominating set problems
Published 2022“…To solve these problems, we propose a two-stage hybrid local search algorithm. In the first stage, we propose an adaptive information content-based local search algorithm as an exploratory procedure. …”
Get full text
Get full text
Article -
15
A hybrid local search algorithm for minimum dominating set problems
Published 2022“…To solve these problems, we propose a two-stage hybrid local search algorithm. In the first stage, we propose an adaptive information content-based local search algorithm as an exploratory procedure. …”
Get full text
Get full text
Article -
16
Provider independent cryptographic tools
Published 2003Get full text
Get full text
Get full text
Monograph -
17
-
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
A maximal-clique-based clustering approach for multi-observer multi-view data by using k-nearest neighbor with S-pseudo-ultrametric induced by a fuzzy similarity
Published 2024“…To this end, we first build a k-nearest neighbor (kNN) directed graph using the proposed S-distance, then transform it into an undirected graph based on the neighborhood information of the nodes so that the resultant graph is characterized based on nodes interactions and initial features information of the nodes. …”
Get full text
Get full text
Article -
20
