graph, which exhibits the properties of a nonplanar graph. In this paper, we would like to propose an algorithm “Coordinate theory On Line ... Segment” (COLS) to reduce a nonplanar graph to a planar graph by removing…
time response taken during data encryption using Microsoft Excel. The graph result shows the superiority of RSA and AES algorithms over other algorithms in terms of the processing speed ... have any. Further analysis…
trajectories are mined to provide the landmark graph. Based on the landmark graph and the routing algorithm that uses the variance-entropy based clustering techniques to build and evaluate ... real world GPS…
functioning of computer networks, and emergent behavior of physical and biological systems. Class learning algorithms are used on released data to predict private information. Inference attacks are initiated using…
testing for conditional dependence, algorithms can generate directed acyclic graphs (DAGs), which may help inform variable selection when building models for statistical risk prediction or for assessing causal…
graphs in the constructed graph. During the first procedure the graph is discredited and a graphbased knowledge discovery algorithm is applied to find the repeating sub graphs. Even though
quality and the grey prediction model, the grey correlation degree, directed graph and existing edge detection algorithm, this paper proposed a new edge detection algorithm to obtain complete and continuous
produce high-quality sequence alignments. A variety of computational algorithms have been applied to the sequence alignment problem Graph theory is developing as a promising field in various applications ... this method…
motor movement database for generating any signal is attached. The driving Algorithm and the process flow graph for the stepper motor controlled artificial hand is implemented .This attempt would provide
external memory bandwidth and internal buffer size. Based on the data flow graph of the flipped lifting algorithm, the processing units are developed for maximally utilizing the inherent parallelism. With
analysis in this paper, uses the network techniques in conjunction with graph theory resulting in a powerful algorithm for nonlinear load flow analysis. Six pulse converters model were used
customer’s purchase consumption over time in the retail database. An algorithm for the Customer Purchase Evolution Graph (CPEG) is proposed. To prove practicability, nearly 300,000 actual transactions from
Algorithm. The main objective is the low cost of the implementation. The shortest path problem is to find a path between two vertices (nodes) on a given graph, such that ... design of transportation systems. The classic…
subsets of variables. However, a number of rigorous approximation algorithms have been devised for performing inference in MRFs. Factor graphs are more useful for describing models that involve a large ... represented…
analysis.We show that bipartite network can be conveniently represented as linear graph formodule identification purposes. We apply the algorithm to real-world network data, showing that the algorithmsuccessfully…
counting rules for computing the number of independent sets in graphs. We explore different techniques and algorithms employed to efficiently determine the count of independent sets, discussing their applications
present the Suffix-Graph, a data structure that store graphs efficiently and to design an algorithm to retrieve subgraph efficiently that detects network motifs and apply them to transcriptional interactions
pixels in the background model of the previous frame. The graph cut segmentation based region merging algorithm approach achieves both segmentation and optical flow computation accurately and they can work
largest eigenvalue plays a key role in complex systems optimization. The algorithms minimizing the second largest eigenvalue of graphs have been already used to speed up processes in computer networks
existing approaches, which rely on edge editing or node clustering, may significantly alter key graph properties. In this paper, k-degree-l-diversity anonymity model that considers the protection ... anonymization…
accustomed agitate each vast and high-dimensional data sets wherever existing algorithms fail. Other ways like possibility, Hyper graph theory or agglomeration ways in which goes fail in outlier detection
sensitive labels of individuals as well. Also the study the algorithmic impact of adding noise nodes to original graph and the rigorous analyses on the theoretical limitations of the appended
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.